Non-cooperative facility location and covering games

Theoretical Computer Science

Volumn 411, Issue 16-18, 2010, Pages 1855-1876

  Cardinal, Jean ^a   Hoefer, Martin ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Approximate equilibrium; Cost Sharing; Facility location; Nash equilibrium; Price of anarchy

Indexed keywords

COST SHARING; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; GENERAL CLASS; INTEGER PROGRAM; INTEGER PROGRAMMING FORMULATIONS; INTEGRALITY GAPS; NASH EQUILIBRIA; NASH EQUILIBRIUM; NON-COOPERATIVE; NONCOOPERATIVE GAME; NP-HARD; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; PURE NASH EQUILIBRIUM; SINGLE CONSTRAINT;

COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

COSTS;

EID: 77949261559     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.02.005     Document Type: Article

References (45)

1. Albers S. On the value of coordination in network design. SIAM J. Comput. 38 6 (2009) 2273-2302
2. Alon N., Moshkovitz D., and Safra S. Algorithmic construction of sets with k-restrictions. ACM Trans. Algorithms 2 2 (2006) 153-177
3. Elliot Anshelevich, Bugra Caskurlu, Exact and approximate equilibria for optimal group network formation, in: Proc. 17th European Symposium on Algorithms, ESA, 2009, pp. 239-250.
4. Elliot Anshelevich, Bugra Caskurlu, Price of stability in survivable network design, in: Proc. 2nd Intl. Symp. Algorithmic Game Theory, SAGT, 2009, pp. 208-219.
5. Anshelevich E., Dasgupta A., Kleinberg J., Roughgarden T., Tardos É., and Wexler T. The price of stability for network design with fair cost allocation. SIAM J. Comput. 38 4 (2008) 1602-1623
6. Anshelevich E., Dasgupta A., Tardos É., and Wexler T. Near-optimal network design with selfish agents. Theory Comput. 4 (2008) 77-109
7. Baruch Awerbuch, Yossi Azar, Amir Epstein, The price of routing unsplittable flow, in: Proc. 37th Symp. Theory of Computing, STOC, 2005, pp. 331-337.
8. Baker B. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41 1 (1994) 153-180
9. Balinski M. Integer programming: Methods, uses, computation. Manag. Sci. 12 3 (1965) 253-313
10. Jaroslaw Byrka, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, in: Proc. 10th Intl. Workshop Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 2007, pp. 29-43.
11. Jean Cardinal, Martin Hoefer, Selfish service installation in networks, in: Proc. 2nd Intl. Workshop Internet & Network Economics, WINE, 2006, pp. 174-185.
12. Moses Charikar, Howard Karloff, Claire Mathieu, Joseph Naor, Michael Saks, Online multicast with egalitarian cost sharing, in: Proc. 20th Symp. Parallelism in Algorithms and Architectures, SPAA, 2008, pp. 70-76.
13. Chekuri C., Chuzhoy J., Lewin-Eytan L., Naor J., and Orda A. Non-cooperative multicast and facility location games. IEEE J. Sel. Areas Commun. 25 6 (2007) 1193-1206
14. Chen H.-L., and Roughgarden T. Network design with weighted players. Theory Comput. Syst. 45 2 (2009) 302-324
15. Ho-Lin Chen, Tim Roughgarden, Gregory Valiant, Designing networks with good equilibria, in: Proc. 19th Symp. Discrete Algorithms, SODA, 2008, pp. 854-863.
16. George Christodoulou, Elias Koutsoupias, On the price of anarchy and stability of correlated equilibria of linear congestion games, in: Proc. 13th European Symposium on Algorithms, ESA, 2005, pp. 59-70.
17. Deng X., Ibaraki T., and Nagamochi H. Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24 3 (1999) 751-766
18. Nikhil Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay Vazirani, Price of anarchy, locality gap, and a network service provider game, in: Proc. 1st Intl. Workshop Internet & Network Economics, WINE, 2005, pp. 1046-1055.
19. Devanur N., Mihail M., and Vazirani V. Strategyproof cost-sharing mechanisms for set cover and facility location problems. Decis. Support Syst. 39 1 (2005) 11-22
20. Eidenbenz S., Kumar A., and Zust S. Equilibria in topology control games for ad hoc networks. Mobile Netw. Appl. 11 2 (2006) 143-159
21. Eiselt H., Laporte G., and Thisse J.-F. Competitive location models: A framework and bibliography. Transp. Sci. 27 (1993) 44-54
22. Epstein A., Feldman M., and Mansour Y. Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67 1 (2009) 51-68
23. Everett H. Recursive games. In: Kuhn H., and Tucker A. (Eds). Contributions to the Theory of Games III. Annals of Mathematical Studies vol. 39 (1957) 47-78
24. Alex Fabrikant, Ankur Luthera, Elitza Maneva, Christos Papadimitriou, Scott Shenker, On a network creation game, in: Proc. 22nd Symp. Principles of Distributed Computing, PODC, 2003, pp. 347-351.
25. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
26. Goemans M., and Skutella M. Cooperative facility location games. J. Algorithms 50 2 (2004) 194-214
27. Guha S., and Khuller S. Greedy strikes back: Improved facility location algorithms. J. Algorithms 31 (1999) 228-248
28. Magnus Halldórsson, Joe Halpern, Li Li, Vahab Mirrokni, On spectrum sharing games, in: Proc. 22nd Symp. Principles of Distributed Computing, PODC, 2004, pp. 107-114.
29. Martin Hoefer, Non-cooperative facility location and covering games, in: Proc. 17th Intl. Symp. Algorithms and Computation, ISAAC, 2006, pp. 369-378.
30. Hoefer M. Non-cooperative tree creation. Algorithmica 53 1 (2009) 104-131
31. Martin Hoefer, Piotr Krysta, Geometric network design with selfish agents, in: Proc. 11th Conf. Computing and Combinatorics, COCOON, 2005, pp. 167-178.
32. Immorlica N., Mahdian M., and Mirrokni V. Limitations of cross-monotonic cost sharing schemes. ACM Trans. Algorithms 4 2 (2008) Special Issue SODA 2005
33. Kamal Jain, Vijay Vazirani, Applications of approximation algorithms to cooperative games, in: Proc. 33rd Symp. Theory of Computing, STOC, 2001, pp. 364-372.
34. Khot S., and Regev O. Vertex cover might be hard to approximate within 2 - ε{lunate}. J. Comput. Syst. Sci. 74 3 (2008) 335-349
35. Elias Koutsoupias, Christos Papadimitriou, Worst-case equilibria, in: Proc. 16th Symp. Theoretical Aspects of Computer Science, STACS, 1999, pp. 404-413.
36. Xiang-Yang Li, Zheng Sun, Weizhao Wang, Cost sharing and strategyproof mechanisms for set cover games, in: Proc. 22nd Symp. Theoretical Aspects of Computer Science, STACS, 2005, pp. 218-230.
37. Li X.-Y., Sun Z., Wang W., Chu X., Tang S., and Xu P. Mechanism design for set cover games with selfish element agents. Theoret. Comput. Sci. 411 1 (2010) 174-187
38. Mettu R., and Plaxton G. The online median problem. SIAM J. Comput. 32 3 (2003) 816-832
39. Miller T., Friesz T., and Tobin R. Equilibrium Facility Location in Networks (1996), Springer Verlag
40. Monderer D., and Shapley L. Potential games. Games Econ. Behav. 14 (1996) 1124-1143
41. Martin Pál, Éva Tardos, Group strategyproof mechanisms via primal-dual algorithms, in: Proc. 44th Symp. Foundations of Computer Science, FOCS, 2003, pp. 584-593.
42. Christos Papadimitriou, Algorithms, games and the internet, in: Proc. 33rd Symp. Theory of Computing, STOC, 2001, pp. 749-753.
43. Roughgarden T., and Tardos É. How bad is selfish routing?. J. ACM 49 2 (2002) 236-259
44. Vazirani V. Approximation Algorithms (2000), Springer Verlag
45. Adrian Vetta, Nash equilibria in competitive societies with application to facility location, traffic routing and auctions, in: Proc. 43th Symp. Foundations of Computer Science, FOCS, 2002, p. 416.