Approximate mechanism design without money
Proceedings of the 10th ACM conference on Electronic commerce
Tighter Bounds for Facility Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Asymptotically optimal strategy-proof mechanisms for two-facility games
Proceedings of the 11th ACM conference on Electronic commerce
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Strategy-proof mechanisms for facility location games with many facilities
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Approximately optimal mechanism design via differential privacy
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Mechanism design on discrete lines and cycles
Proceedings of the 13th ACM Conference on Electronic Commerce
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Theoretical Computer Science
Strategyproof facility location and the least squares objective
Proceedings of the fourteenth ACM conference on Electronic commerce
Strategyproof facility location for concave cost functions
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
We investigate the approximability of K-Facility Location by deterministic strategyproof mechanisms. Our main result is an elegant characterization of deterministic strategyproof mechanisms with a bounded approximation ratio for 2-Facility Location on the line. Specifically, we show that for instances with n≥5 agents, any such mechanism either admits a unique dictator, or always places the facilities at the two extremes. As a consequence, we obtain that the best approximation ratio achievable by deterministic strategyproof mechanisms for 2-Facility Location on the line is precisely n−2. Employing a technical tool developed for the characterization, we show that for every K≥3, there do not exist any deterministic anonymous strategyproof mechanisms with a bounded approximation ratio for K-Facility Location on the line, even for simple instances with K+1 agents. Moreover, building on the characterization for the line, we show that there do not exist any deterministic mechanisms with a bounded approximation ratio for 2-Facility Location in more general metric spaces, which is true even for simple instances with 3 agents located in a star.