Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives
METADATA ONLY
Loading...
Author / Producer
Date
2020
Publication Type
Conference Paper, Conference Paper
ETH Bibliography
no
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
We consider the facility location problem in the one-dimensional setting where each facility can serve a limited number of agents from the algorithmic and mechanism design perspectives. From the algorithmic perspective, we prove that the corresponding optimization problem, where the goal is to locate facilities to minimize either the total cost to all agents or the maximum cost of any agent is NP-hard. However, we show that the problem is fixed-parameter tractable, and the optimal solution can be computed in polynomial time whenever the number of facilities is bounded, or when all facilities have identical capacities. We then consider the problem from a mechanism design perspective where the agents are strategic and need not reveal their true locations. We show that several natural mechanisms studied in the uncapacitated setting either lose strategyproofness or a bound on the solution quality %on the returned solution for the total or maximum cost objective. We then propose new mechanisms that are strategyproof and achieve approximation guarantees that almost match the lower bounds.
Permanent link
Publication status
published
External links
Editor
Book title
AAAI-20 Technical Tracks 2
Volume
34 (2)
Pages / Article No.
1806 - 1813
Publisher
AAAI
Event
34th AAAI Conference on Artificial Intelligence (AAAI 2020)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
09768 - Lee, Barton E. / Lee, Barton E.