Efficient graph topologies in network routing games

[1]  Yishay Mansour,et al.  Strong equilibrium in cost sharing connection games , 2007, EC '07.

[2]  O. Rozenfeld Strong Equilibrium in Congestion Games , 2007 .

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

[4]  Costas Busch,et al.  Atomic routing games on maximum congestion , 2006, Theor. Comput. Sci..

[5]  Ariel Orda,et al.  Bottleneck Routing Games in Communication Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Igal Milchtaich,et al.  Network Topology and the Efficiency of Equilibrium , 2005, Games Econ. Behav..

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

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

[9]  Igal Milchtaich,et al.  Topological Conditions for Uniqueness of Equilibrium in Networks , 2005, Math. Oper. Res..

[10]  Tim Roughgarden,et al.  Selfish routing with atomic players , 2005, SODA '05.

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

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

[13]  Ron Holzman,et al.  Network structure and strong equilibrium in route selection games , 2003, Math. Soc. Sci..

[14]  Yishay Mansour,et al.  Convergence Time to Nash Equilibria , 2003, ICALP.

[15]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

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

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

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

[19]  Clark Jeffries,et al.  Congestion resulting from increased capacity in single-server queueing networks , 1997, TNET.

[20]  Joel E. Cohen,et al.  Paradoxical behaviour of mechanical and electrical networks , 1991, Nature.

[21]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

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

[23]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.