2026
Designing Optimal Mechanisms to Locate Facilities with Insufficient Capacity for Bayesian Agents
AAAI 2026technical
In this paper, we study the Facility Location Problem with Scarce Resources (FLPSR) under the assumption that agents
4 accepted papers
In this paper, we study the Facility Location Problem with Scarce Resources (FLPSR) under the assumption that agents
In this paper, we investigate the Mechanism Design aspects of the m-Capacitated Facility Location Problem (m-CFLP) on a line. We focus on two frameworks. In the first framework, the number of facilities is arbitrary, all facilities have the same capacity, and the number of agents is equal to the tot…
This paper investigates the Mechanism Design aspects of the $m$-Capacitated Facility Location Problem where the total facility capacity is lower than the number of agents. Following \cite{aziz2020capacity}, the Social Welfare of the facility location is determined through a First-Come-First-Served…
This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a $(d+1)$-partite graph with $(d+1)n$ nodes and $dn^{\…