The price of anarchy of finite congestion games

We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ(√N), where N is the number of players. For all other cases of symmetric or asymmetric games and for both maximum and average social cost, the price of anarchy is 5/2. We extend the results to latency functions that are polynomials of bounded degree. We also extend some of the results to mixed Nash equilibria.

[1]  Berthold Vöcking,et al.  Selfish traffic allocation for server farms , 2002, STOC '02.

[2]  L. Shapley,et al.  Potential Games , 1994 .

[3]  Tim Roughgarden.  The maximum latency of selfish routing , 2004, SODA '04.

[4]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

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

[6]  Marios Mavronicolas,et al.  The price of anarchy for polynomial social cost , 2004, Theor. Comput. Sci..

[7]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[9]  José R. Correa,et al.  Sloan School of Management Working Paper 4447-03 November 2003 Computational Complexity , Fairness , and the Price of Anarchy of the Maximum Latency Problem , 2003 .

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

[11]  Marios Mavronicolas,et al.  A new model for selfish routing , 2004, Theor. Comput. Sci..

[12]  Paul G. Spirakis,et al.  The Price of Selfish Routing , 2001, STOC '01.

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

[14]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

[16]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[17]  Csaba D. Tóth,et al.  Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.

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

[19]  P. Gács,et al.  Algorithms , 1992 .

[20]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[21]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[22]  Marios Mavronicolas,et al.  Nash Equilibria in Discrete Routing Games with Convex Latency Functions , 2004, ICALP.

[23]  Tim Roughgarden.  The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..

[24]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

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

[26]  Paul G. Spirakis,et al.  Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.