1 citations · 1 across the 8 of their papers we have counts for
9 papers
Learning to Solve Compositional Geometry Routing Problems
Mingfeng Fan, Jianan Zhou, Jiaqi Cheng +3
We study the Compositional Geometry Routing Problem (CGRP), a unified superclass of traditional routing problems that covers point-only, line-only, area-only, and arbitrary hybrid…
Designing Optimal Mechanisms to Locate Facilities with Insufficient Capacity for Bayesian Agents
Gennaro Auricchio, Jie Zhang
In this paper, we study the Facility Location Problem with Scarce Resources (FLPSR) under the assumption that agents' type follow a probability distribution. In the FLPSR, the obje…
Facility Location Problem with Aleatory Agents
Gennaro Auricchio, Jie Zhang
In this paper, we introduce and study the Facility Location Problem with Aleatory Agents (FLPAA), where the facility accommodates n agents larger than the number of agents reportin…
Mechanism Design for Locating Facilities with Capacities with Insufficient Resources
Gennaro Auricchio, Harry J. Clough, Jie Zhang
This paper explores the Mechanism Design aspects of the -Capacitated Facility Location Problem where the total facility capacity is less than the number of agents. Following the…
The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms
Gennaro Auricchio, Jie Zhang
In this paper, we investigate the -Facility Location Problem (-FLP) within the Bayesian Mechanism Design framework, in which agents' preferences are samples of a probability…
Facility Location Problems with Capacity Constraints: Two Facilities and Beyond
Gennaro Auricchio, Zihe Wang, Jie Zhang
In this paper, we investigate the Mechanism Design aspects of the -Capacitated Facility Location Problem (-CFLP) on a line. We focus on two frameworks. In the first framework…
From Optimal Transport to Efficient Mechanisms for the -Capacitated Facilities Location Problem with Bayesian Agent
Gennaro Auricchio, Jie Zhang, Mengxiao Zhang
In this paper, we study of the -Capacitated Facility Location Problem (-CFLP) on the line from a Bayesian Mechanism Design perspective and propose a novel class of mechanisms…
Edge Manipulations for the Maximum Vertex-Weighted Bipartite b-matching
Gennaro Auricchio, Qun Ma, Jie Zhang
In this paper, we explore the Mechanism Design aspects of the Maximum Vertex-weighted -Matching (MVbM) problem on bipartite graphs . The set comprises agents,…
On the Distortion of Multi-winner Election Using Single-Candidate Ballots
Gennaro Auricchio, Zeyu Ren, Zihe Wang +1
In this paper, we study the distortion bounds for voting mechanisms in multi-winner elections in general metric spaces. Our study pertains to the case in which each voter only repo…