Congestion Games with Player-Specific Costs Revisited

We study the existence of pure Nash equilibria in congestion games with player-specific costs. Specifically, we provide a thorough characterization of the maximal sets of cost functions that guarantee the existence of a pure Nash equilibrium.

[1]  Rolf H. Möhring,et al.  Characterizing the Existence of Potential Functions in Weighted Congestion Games , 2011, Theory of Computing Systems.

[2]  Igal Milchtaich,et al.  The Equilibrium Existence Problem in Finite Network Congestion Games , 2006, WINE.

[3]  Igal Milchtaich,et al.  Representation of finite games as network congestion games , 2011, International Conference on NETwork Games, Control and Optimization (NetGCooP 2011).

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

[5]  Marios Mavronicolas,et al.  Congestion Games with Player-Specific Constants , 2007, MFCS.

[6]  Robert J. Aumann,et al.  16. Acceptable Points in General Cooperative n-Person Games , 1959 .

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

[8]  Robert W. Rosenthal,et al.  The network equilibrium problem in integers , 1973, Networks.

[9]  Archie C. Chapman,et al.  On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games , 2011, SAGT.

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

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

[12]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

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

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

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

[16]  Mark Voorneveld,et al.  Congestion Games and Potentials Reconsidered , 1999, IGTR.

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

[18]  Chryssis Georgiou,et al.  Selfish Routing in the Presence of Network Uncertainty , 2009, Parallel Process. Lett..

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

[20]  Maxime Crochemore,et al.  Finding Patterns In Given Intervals , 2007, Fundam. Informaticae.

[21]  M. Breton,et al.  Equilibria in a Model with Partial Rivalry , 1997 .

[22]  Martin Gairing,et al.  Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions , 2006, ICALP.

[23]  Alexander Skopalik,et al.  On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games , 2007, WINE.

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

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

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