Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria

In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions.

[1]  Max Klimm,et al.  Approximate Pure Nash Equilibria in Weighted Congestion Games , 2011, ACM Trans. Economics and Comput..

[2]  Tim Roughgarden,et al.  Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness , 2014, TEAC.

[3]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[4]  Martin Gairing,et al.  Exact Price of Anarchy for Polynomial Congestion Games , 2006, SIAM J. Comput..

[5]  Mark de Berg,et al.  Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I , 2010, ESA.

[6]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

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

[8]  Tim Roughgarden,et al.  Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness , 2010, ESA.

[9]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

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

[11]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[12]  Martin Gairing,et al.  Price of Stability in Polynomial Congestion Games , 2013, TEAC.

[13]  Ioannis Caragiannis,et al.  Tight Bounds for Selfish and Greedy Load Balancing , 2006, Algorithmica.

[14]  Berthold Vöcking,et al.  On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

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

[17]  Sanjeev Khanna,et al.  Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games , 2010, EC '10.

[18]  Martin Gairing,et al.  Covering Games: Approximation through Non-cooperation , 2009, WINE.

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

[20]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[23]  Angelo Fanelli,et al.  Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

[25]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[26]  Paul G. Spirakis,et al.  On the Performance of Approximate Equilibria in Congestion Games , 2008, Algorithmica.

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