Convergence and approximation in potential games

[1]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[2]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[4]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5]  Svatopluk Poljak.  Integer Linear Programs and Local Search for Max-Cut , 1995, SIAM J. Comput..

[6]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[7]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[8]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[9]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[10]  Yishay Mansour,et al.  Convergence Time to Nash Equilibria , 2003, ICALP.

[11]  Moses Charikar,et al.  Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Csaba D. Tóth,et al.  Selfish load balancing and atomic congestion games , 2004, SPAA '04.

[13]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[14]  Vahab S. Mirrokni,et al.  Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.

[15]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.

[16]  Csaba D. Tóth,et al.  Uncoordinated Load Balancing and Congestion Games in P2P Systems , 2004, IPTPS.

[17]  Vahab S. Mirrokni,et al.  Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[18]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[19]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[20]  Elias Koutsoupias,et al.  On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.

[21]  V. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.

[22]  Vahab S. Mirrokni,et al.  Convergence and approximation in potential games , 2006, Theor. Comput. Sci..

[23]  Marina Thottan,et al.  Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.

[24]  Steve Chien,et al.  Convergence to approximate Nash equilibria in congestion games , 2007, SODA '07.

[25]  Yossi Azar,et al.  Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.

[26]  Angelo Fanelli,et al.  The Speed of Convergence in Congestion Games under Best-Response Dynamics , 2008, ICALP.

[27]  Berthold Vöcking,et al.  Inapproximability of pure nash equilibria , 2008, STOC.

[28]  Vittorio Bilò,et al.  Performances of One-Round Walks in Linear Congestion Games , 2009, SAGT.