Abstract
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents’ locations to a set of facilities. The agents seek to minimize their connection cost, namely the distance of their true location to the nearest facility, and may misreport their location. We are interested in mechanisms that are strategyproof, i.e., ensure that no agent can benefit from misreporting her location, do not resort to monetary transfers, and approximate the optimal social cost. We focus on the closely related problems of k-Facility Location and Facility Location with a uniform facility opening cost, and mostly study winner-imposing mechanisms, which allocate facilities to the agents and require that each agent allocated a facility should connect to it. We show that the winner-imposing version of the Proportional Mechanism (Lu et al., EC ’10) is stategyproof and 4k-approximate for the k-Facility Location game. For the Facility Location game, we show that the winner-imposing version of the randomized algorithm of (Meyerson, FOCS ’01), which has an approximation ratio of 8, is strategyproof. Furthermore, we present a deterministic non-imposing group strategyproof O(logn)-approximate mechanism for the Facility Location game on the line.
Research partially supported by an NTUA Basic Research Grant (PEBE 2009).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Mathematics of Operations Research (to appear, 2010)
Anagnostopoulos, A., Bent, R., Upfal, E., van Hentenryck, P.: A simple and deterministic competitive algorithm for online facility location. Information and Computation 194, 175–202 (2004)
Barberà, S.: An introduction to strategyproof social choice functions. Social Choice and Welfare 18, 619–653 (2001)
Barberà, S., Beviá, C.: Locating public libraries by majority: Stability, consistency and group formation. Games and Economic Behaviour 56, 185–200 (2006)
Barberà, S., Jackson, M.: A characterization of strategy-proof social choice functions for economies with pure public goods. Journal of Economic Theory 61, 262–289 (1994)
Guha, S.: Approximation Algorithms for Facility Location Problems. PhD thesis, Stanford University (2000)
Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 (2010)
Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM 48(2), 274–296 (2001)
Ju, B.-G.: Efficiency and consistency for locating multiple public facilities. Journal of Economic Theory 138, 165–183 (2008)
Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proc. of the 11th ACM Conference on Electronic Commerce (EC 2010), pp. 315–324 (2010)
Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 137–148. Springer, Heidelberg (2009)
McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proc. of the 48th IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94–103 (2007)
Meyerson, A.: Online facility location. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 426–431 (2001)
Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory. Wiley, Chichester (1990)
Miyagawa, E.: Locating libraries on a street. Social Choice and Welfare 18, 527–541 (2001)
Moulin, H.: On strategy-proofness and single-peakedness. Public Choice 35, 437–455 (1980)
Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. CoRR abs/1004.2888 (2010)
Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proc. of the 10th ACM Conference on Electronic Commerce (EC 2009), pp. 177–186 (2009)
Schummer, J., Vohra, R.V.: Strategyproof location on a network. Journal of Economic Theory 104, 405–428 (2002)
Shmoys, D.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)
Sprumont, Y.: The division problem with single-peaked preferences: A characterization of the uniform allocation rule. Econometrica 49, 509–519 (1991)
Sprumont, Y.: Strategyproof collective choice in economic and political environments. The Canadian Journal of Economics 28(1), 68–108 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fotakis, D., Tzamos, C. (2010). Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. In: Saberi, A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17572-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-17572-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17571-8
Online ISBN: 978-3-642-17572-5
eBook Packages: Computer ScienceComputer Science (R0)