A Survey on Approximation Mechanism Design without Money for Facility Games
Yukun Cheng, Sanming Zhou

TL;DR
This survey reviews models and results for strategy-proof, money-free approximation mechanisms in facility location games, covering both obnoxious and standard variants, and introduces a general framework for their design.
Contribution
It provides a comprehensive overview of existing models and results, and proposes a unified framework for designing approximation mechanisms without monetary transfers.
Findings
Summarizes deterministic and randomized mechanism results.
Highlights strategy-proofness and approximation guarantees.
Identifies open problems and future research directions.
Abstract
In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be far away from all facilities, and her utility is the distance from her location to the facility set. The objective of each agent is to minimize her cost or maximize her utility. An agent may lie if, by doing so, more benefit can be obtained. We are interested in social choice mechanisms that do not utilize payments. The game designer aims at a mechanism that is strategy-proof, in the sense that any agent cannot benefit by misreporting her address, or, even better, group strategy-proof, in the…
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.
