Strategy Proof Mechanisms for Facility Location with Capacity Limits
Toby Walsh

TL;DR
This paper explores how capacity limits in facility location problems complicate strategy-proof mechanism design but can paradoxically enhance approximation guarantees for solutions.
Contribution
It demonstrates that capacity constraints, while complicating strategy-proof mechanism design, can actually lead to better approximation guarantees in facility location problems.
Findings
Capacity constraints make strategy-proof mechanism design more challenging.
Counter-intuitively, capacity limits can improve approximation guarantees.
The paper provides new insights into facility location with capacity constraints.
Abstract
An important feature of many real world facility location problems are capacity limits on the facilities. We show here how capacity constraints make it harder to design strategy proof mechanisms for facility location, but counter-intuitively can improve the guarantees on how well we can approximate the optimal solution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Auction Theory and Applications · Logic, Reasoning, and Knowledge
