Approximate Pure Nash Equilibria in Weighted Congestion Games

We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions.

[1]  I. Glicksberg.  A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[2]  Paul G. Spirakis,et al.  Selfish Unsplittable Flows , 2004, ICALP.

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

[4]  Andreas S. Schulz,et al.  On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games , 2006, WINE.

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

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

[7]  Ariel Orda,et al.  Atomic Resource Sharing in Noncooperative Networks , 2001, Telecommun. Syst..

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

[9]  Berthold Vöcking,et al.  Pure Nash equilibria in player-specific and weighted congestion games , 2009, Theor. Comput. Sci..

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

[11]  Angelo Fanelli,et al.  Approximate Pure Nash Equilibria in Weighted Congestion Games , 2015, ACM Trans. Economics and Comput..

[12]  Alexander Skopalik,et al.  Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games , 2008, Internet Math..

[13]  Berthold Vöcking,et al.  On the Impact of Combinatorial Structure on Congestion Games , 2006, FOCS.

[14]  Tim Roughgarden,et al.  Network Design with Weighted Players , 2006, SPAA '06.

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

[16]  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.

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

[18]  Max Klimm,et al.  On the Existence of Pure Nash Equilibria in Weighted Congestion Games , 2010, Math. Oper. Res..

[19]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[20]  Panagiota N. Panagopoulou,et al.  Algorithms for pure Nash equilibria in weighted congestion games , 2007, JEAL.