Exact Price of Anarchy for Polynomial Congestion Games

We show exact values for the price of anarchy of weighted and unweighted congestion games with polynomial latency functions. The given values also hold for weighted and unweighted network congestion games.

[1]  H. Peyton Young,et al.  Strategic Learning and Its Limits , 2004 .

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

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

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

[5]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[6]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

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

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

[9]  Martin Gairing,et al.  Selfish Routing with Incomplete Information , 2005, SPAA '05.

[10]  Paul G. Spirakis,et al.  Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost , 2005, WAOA.

[11]  Mohammad Taghi Hajiaghayi,et al.  Regret minimization and the price of total anarchy , 2008, STOC.

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

[13]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[14]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[15]  Marios Mavronicolas,et al.  Nash equilibria in discrete routing games with convex latency functions , 2004, J. Comput. Syst. Sci..

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

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

[18]  Martin Gairing,et al.  Total Latency in Singleton Congestion Games , 2007, WINE.

[19]  Paul G. Spirakis,et al.  Selfish unsplittable flows , 2005, Theor. Comput. Sci..

[20]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

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

[22]  Georgia Perakis,et al.  The "Price of Anarchy" Under Nonlinear and Asymmetric Costs , 2007, Math. Oper. Res..

[23]  R. Aumann.  Subjectivity and Correlation in Randomized Strategies , 1974 .

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

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

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

[27]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[28]  Yossi Azar,et al.  Tradeoffs in worst-case equilibria , 2006, Theor. Comput. Sci..

[29]  Tim Roughgarden,et al.  How unfair is optimal routing? , 2002, SODA '02.

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

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

[32]  R. McKelvey,et al.  Computation of equilibria in finite games , 1996 .

[33]  Martin Gairing,et al.  Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture , 2005, ICALP.

[34]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

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

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