|
483
|
Worst-case equilibria
– Elias Koutsoupias, Christos Papadimitriou
- 1999
|
|
403
|
How bad is selfish routing?
– Tim Roughgarden, Éva Tardos
- 2002
|
|
307
|
A class of games possessing pure-strategy Nash equilibria
– R W Rosenthal
- 1973
|
|
131
|
Tight bounds for worst-case equilibria
– Artur Czumaj, Berthold Vöcking
- 2002
|
|
231
|
the internet
– C H Algorithms Papadimitriou, games
- 2001
|
|
45
|
Approximate Equilibria and Ball Fusion
– Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis
- 2002
|
|
71
|
Selfish Traffic Allocation for Server Farms
– Piotr Krysta, Artur Czumaj, Berthold Vöcking
- 2003
|
|
99
|
P.G.: The price of selfish routing
– M Mavronicolas, Spirakis
- 2007
|
|
107
|
Congestion games with player specific pay-off functions
– I Milchtaich
- 1996
|
|
307
|
Some theoretical aspects of road traffic research
– J Wardrop
- 1952
|
|
230
|
Potential games
– D Monderer, L Shapley
- 1996
|
|
96
|
The Price of Anarchy of Finite Congestion Games
– George Christodoulou, Elias Koutsoupias
- 2005
|
|
89
|
The traffic assignment problem for a general network
– S C Dafermos, F T Sparrow
- 1969
|
|
37
|
A new model for selfish routing
– T Lücking, M Mavronicolas, B Monien, M Rode
|
|
150
|
The Price of Stability for Network Design with Fair Cost Allocation
– Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
- 2004
|
|
113
|
The Complexity of Pure Nash Equilibria
– Alex Fabrikant, Christos Papadimitriou, Kunal Talwar
- 2004
|
|
87
|
The price of routing unsplittable flow
– B AWERBUCH, Y AZAR, L EPSTEIN
|
|
583
|
Non-cooperative games
– J Nash
- 1951
|
|
45
|
Bounding the Inefficiency of Equilibria in Nonatomic Congestion Games
– Tim Roughgarden, Eva Tardos, Éva Tardos
- 2002
|
