collaborators

6 papers

cs.AI2026

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…

cs.GT2024

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…

cs.GT2024

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…

cs.GT2024

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…

cs.GT2024

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…

cs.GT2024

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…