Non-cooperative facility location and covering games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4288 LNCS, Issue , 2006, Pages 369-378

  Hoefer, Martin ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

COMPUTATIONAL COMPLEXITY; FACILITIES; POLYNOMIAL APPROXIMATION;

INTEGER PROGRAMMING;

EID: 77249168264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_38     Document Type: Conference Paper

References (21)

1. E. Anshelevich, A. Dasgupta, J, Kleinberg, T. Roughgarden, É. Tardos, and T. Wexler. The price of stability for network design with fair cost allocation. In Proc 45th FOCS, pages 295-304, 2004.
2. E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler. Near-optimal network design with selfish agents. In Proc 35th STOC, pages 511-520, 2003.
3. J. Cardinal and M. Hoefer. Selfish serive installation in networks. In Proc 2nd Workshop Internet & Network Economics (WINE), 2006.
4. X. Deng, T. Ibaraki, and H. Nagamochi. Combinatorial optimization games. In Proc 8th SODA, pages 720-729, 1997.
5. N. Devanur, N. Garg, R. Khandekar, V. Pandit, A. Saberi, and V. Vazirani. Price of anarchy, locality gap, and a network service provider game. In Proc 1st Workshop Internet & Network Economics (WINE), pages 1046-1055, 2005.
6. N. Devanur, M. Mihail, and V. Vazirani. Strategyproof cost-sharing mechanisms for set cover and facility location problems. In Proc 4th EC, pages 108-114, 2003.
7. H. Eiselt, G. Laporte, and J.-F. Thisse. Competitive location models: A framework and bibliography. Transport. Sci., 27:44-54, 1993.
8. M. Goemans and M. Skutella. Cooperative facility location games. In Proc 11th SODA, pages 76-85, 2000.
9. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. J. Algorithms, 31:228-248, 1999.
10. M. Hoefer. Non-cooperative tree creation. In Proc 31 st MFCS, pages 517-527, 2006.
11. N. Immorlica, M. Mahdian, and V. Mirrokni. Limitations of cross-monotonic cost sharing schemes. In Proc 16th SODA, pages 602-611, 2005.
12. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM, 50(6):795-824, 2003.
13. K. Jain and V. Vazirani. Applications of approximation algorithms to cooperative games. In Proc 33rd STOC, pages 364-372, 2001.
14. E. Koutsoupias and C. Papadimitriou, Worst-case equilibria. In Proc 16th STACS, pages 404-413, 1999.
15. X. Li, Z. Sun, and W. Wang. Cost sharing and strategyproof mechanisms for set cover games In Proc 22nd STACS, pages 218-230, 2005.
16. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. In Proc. 5th APPROX, pages 229-242, 2002.
17. R. Mettu and G. Plaxton. The online median problem. SIAMJ. Comp, 32(3):816-832, 2003.
18. T. Miller, T. Friesz, and R. Tobin. Equilibrium Facility Location in Networks. Springer Verlag, 1996.
19. M. Pál and É, Tardos. Group strategyproof mechanisms via primal-dual algorithms. In Proc 44th FOCS, pages 584-593, 2003.
20. Z. Sun, X. Li, W. Wang, and X. Chu. Mechanism design for set cover games when elements are agents. In Proc 1st Intl Conf Algorithmic Applications in Management (AAIM), 2005.
21. A. Vetta. Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In Proc 43rd FOCS, page 416, 2002.