Convergence and approximation in potential games

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

Volumn 3884 LNCS, Issue , 2006, Pages 349-360

  Christodoulou, George ^a   Mirrokni, Vahab S ^b   Sidiropoulos, Anastasios ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATELY OPTIMAL STATES; POTENTIAL GAMES; SELFISH ROUTING GAMES; SEQUENCE OF MOVEMENTS;

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS;

GAME THEORY;

EID: 33745615776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_28     Document Type: Conference Paper

References (22)

1. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. In STOC, pages 57-66, 2005.
2. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56:89-113, 2004.
3. M. Charikar and A. Wirth. Maximizing quadratic programs: extending Grothendieck's inequality. In FOCS, page to appear, 2004.
4. G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. In ESA, 2005.
5. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. In STOC, pages 67-73, 2005.
6. E. Even-dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibria. In ICALP, pages 502-513, 2003.
7. A. Fabrikant, C. Papadimitriou, and K. Talwar. On the complexity of pure equilibria. In STOC, 2004.
8. L. Fliescher, M. Goemans, V. S. Mirrokni, and M. Sviridenko. (almost) tight approximation algorithms for maximizing general assignment problems. 2004. Submitted.
9. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flow. In ICALP, 2004.
10. M. Goemans, L. Li, V.S.Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. In MOBIHOC, 2004.
11. M. Goemans, V. S. Mirrokni, and A. Vetta. Sink equilibria and convergence. In FOCS, 2005.
12. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115-1145, 1995.
13. D. Johnson, C.H. Papadimitriou, and M. Yannakakis. How easy is local search? J. Computer and System Sciences, 37:79-100, 1988.
14. V.S. Mirrokni and A. Vetta. Convergence issues in competitive games. In RANDOM-APPROX, pages 183-194, 2004.
15. D. Monderer and L. Shapley. Potential games. Games and Economics Behavior, 14:124-143, 1996.
16. C. Papadimitriou. Algorithms, games, and the Internet. In STOC, 2001.
17. S. Poljak. Integer linear programs and local search for max-cut. Siam Journal of Computing, 24(4):822-839, 1995.
18. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
19. T. Roughgarden and E. Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
20. G. D. Tóth S. Suri and Y. Zhou. Selfish load balancing and atomic congestion games. In SPAA, pages 188-195, 2004.
21. G. D. Tóth S. Suri and Y. Zhou. Uncoordinated load balancing and congestion games in p2p systems. In IPTPS, pages 123-130, 2004.
22. A. Schaffer and M. Yannakakis. Simple local search problems that are hard to solve. SIAM journal on Computing, 20(1):56-87, 1991.