Constant-Approximate and Constant-Strategyproof Two-Facility Location
Elijah Journey Fullerton, Zeyuan Hu, and C. Gregory Plaxton

TL;DR
This paper introduces new mechanisms for the two-facility location problem that are both approximately optimal and strategyproof under relaxed conditions, including allowing facilities in the plane and ensuring Lipschitz continuity.
Contribution
It presents the first constant-approximate, constant-strategyproof mechanisms for two-facility location with relaxed assumptions, including planar facility placement and Lipschitz continuity.
Findings
A natural mechanism achieves constant approximation and strategyproofness.
A Lipschitz continuous mechanism maintains constant approximation and strategyproofness.
Mechanisms exhibit stability properties despite large input changes.
Abstract
We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the two facilities. The single-facility variant of this problem admits a simple strategyproof mechanism that minimizes social cost. For two facilities, however, it is known that any strategyproof mechanism is -approximate. We seek to circumvent this strong lower bound by relaxing the problem requirements. Following other work in the facility location literature, we consider a relaxed form of strategyproofness in which no agent can lie and improve their outcome by more than a constant factor. Because the aforementioned lower bound generalizes easily to constant-strategyproof mechanisms, we introduce a second relaxation: Allowing the facilities (but not the agents) to be located in the plane.…
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.
