Characterizing the Existence of Potential Functions in Weighted Congestion Games

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

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

[3]  L. Shapley,et al.  Fictitious Play Property for Games with Identical Interests , 1996 .

[4]  Paul G. Spirakis,et al.  Atomic Congestion Games: Fast, Myopic and Concurrent , 2008, SAGT.

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

[6]  Berthold Vöcking.  Algorithmic Game Theory: Selfish Load Balancing , 2007 .

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

[8]  Paul G. Spirakis,et al.  Atomic Congestion Games Among Coalitions , 2006, ICALP.

[9]  Tim Roughgarden,et al.  Network design with weighted players , 2006, SPAA.

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

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

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

[13]  Tim Roughgarden,et al.  The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

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

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

[16]  Rolf H. Möhring,et al.  Strong Nash Equilibria in Games with the Lexicographical Improvement Property , 2009, WINE.

[17]  Yishay Mansour,et al.  Convergence time to Nash equilibrium in load balancing , 2007, TALG.

[18]  Y. Mansour,et al.  On Nash Equilibria for a Network Creation Game , 2006, TEAC.

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

[20]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[21]  Tim Roughgarden,et al.  Bottleneck links, variable demand, and the tragedy of the commons , 2006, SODA 2006.

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