Abstract
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related facility location problem called the k-facility location problem. As a result, we show that the k-facility location problem has a locality gap of 5. This result is of interest on its own. Our result gives evidence to the belief that the price of anarchy of certain games are related to analysis of local search heuristics.
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.
References
Arya, V., Garg, N., Khandekar, R., Pandit, V., Munagala, K., Meyerson, A.: Local Search Heuristics for k-median and Facility Location Problems. Siam Journal of Computing 33(2), 544–562 (2004)
Charikar, M., Guha, S.: Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. In: Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 378–388 (1999)
Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 1–10 (1999)
Jain, K., Vazirani, V.V.: Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 2–13 (1999)
Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404–413 (1999)
Papadimitriou, C.: Algorithms, games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 749–753 (2001)
Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM 49(2), 236–259 (2002); Preliminary version in FOCS 2000
Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 428–437 (2002)
Vetta, A.: Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Devanur, N., Garg, N., Khandekar, R., Pandit, V., Saberi, A., Vazirani, V. (2005). Price of Anarchy, Locality Gap, and a Network Service Provider Game. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_105
Download citation
DOI: https://doi.org/10.1007/11600930_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)