Fast convergence to nearly optimal solutions in potential games

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2008, Pages 264-273

  Awerbuch, Baruch ^a   Azar, Yossi ^b   Epstein, Amir ^b   Mirrokni, Vahab Seyed ^c   Skopalik, Alexander ^d  

^a Johns Hopkins University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c MICROSOFT RESEARCH   (United States)

^d RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Congestion games; Convergence time; Game theory; Nash equilibrium; Potential games; Price of anarchy

Indexed keywords

APPROXIMATION RATIOS; CONGESTION GAMES; CONVERGENCE RESULTS; CONVERGENCE TIME; DELAY FUNCTION; FAST CONVERGENCE; LINEAR DELAY FUNCTION; LIVENESS; NASH DYNAMICS; NASH EQUILIBRIA; NASH EQUILIBRIUM; OPTIMAL SOLUTIONS; POTENTIAL GAMES; PRICE OF ANARCHY; SPEED OF CONVERGENCE;

AD HOC NETWORKS; DYNAMICS; ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 70349085131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1386790.1386832     Document Type: Conference Paper

References (26)

1. H. Ackermann, H. Röglin, and B. Vöcking. On the impact of combinatorial structure on congestion games. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 613-622, 2006.
2. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The price of stability for network design with fair cost allocation. In FOCS, pages 295-304, 2004.
3. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. In Proc. 37th ACM Symp. on Theory of Computing, pages 57-66, 2005.
4. M. Charikar, C. Mattieu, H. Karloff, S. Naor, and M. Saks. Best response dynamics in multicast cost sharing. 2007. Unpublished Manuscript.
5. C. Chekuri, J. Chuzhoy, L. Lewin, S. Naor, and A. Orda. Non-cooperative multicast and facility location games. In ACM EC, pages 72-81, 2006.
6. Xi Chen and Xiaotie Deng. Settling the complexity of two-player nash equilibrium. In Proc. 47nd IEEE Symp. on Found. of Comp. Science, pages 261-272, 2006.
7. Steve Chien and Alistair Sinclair. Convergence to approximate nash equilibria in congestion games. In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007.
8. G. Christodolou, V. S. Mirrokni, and A. Sidiropolous. Convergence and approximation in potential games. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2006.
9. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. In 37th ACM Symposium on Theory of Computing, pages 67-73, Baltimore, MD, USA, 22-24 May 2005.
10. Artur Czumaj and Berthold Vöcking. Tight bounds for worst-case equilibria. In SODA, pages 413-420, 2002.
11. Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a nash equilibrium. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 71-78, 2006.
12. Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar. The complexity of pure nash equilibria. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 604-612, 2004.
13. A. Fanelli, M. Flammini, and L. Moscardelli. The speed of convergence in congestion games under best-response dynamics. In ICALP 2008. To appear.
14. A. Fanelli, M. Flammini, and L. Moscardelli. On the convergence of multicast games in directed networks. In SPAA, pages 330-338, 2007.
15. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. Theoretical Computer Science, Special Issue on ICALP 2004, 348:226-239, 2005.
16. M. Goemans, L. Li, V.S.Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. In MOBIHOC, 2004.
17. M. Goemans, V. S. Mirrokni, and A. Vetta. Sink equilibria and convergence. In FOCS, 2005.
18. D. Johnson, C.H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37:79-100, 1988.
19. V. S. Mirrokni. Approximation Algorithms for Distributed and Selfish Agents. Massachusetts Institute of Technology, 2005.
20. V.S. Mirrokni and A. Vetta. Convergence issues in competitive games. In RANDOM-APPROX, pages 183-194, 2004.
21. Christos Papadimitriou. Algorithms, Games, and the Internet. In Proceedings of 33rd STOC, pages 749-753, 2001.
22. R. W. Rosenthal. A class of games possesing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
23. T. Roughgarden and Eva Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
24. A. Schaffer and M. Yannakakis. Simple local search problems that are hard to solve. SIAM journal on Computing, 20(1):56-87, 1991.
25. A. Skopalik and B. Vöcking. Inapproximability of pure nash equilibria. In 40th ACM Symposium on Theory of Computing, 2008.
26. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.