|
483
|
Worst-case equilibria
– Elias Koutsoupias, Christos Papadimitriou
- 1999
|
|
131
|
Tight bounds for worst-case equilibria
– Artur Czumaj, Berthold Vöcking
- 2002
|
|
403
|
How bad is selfish routing?
– Tim Roughgarden, Éva Tardos
- 2002
|
|
99
|
P.G.: The price of selfish routing
– M Mavronicolas, Spirakis
- 2007
|
|
307
|
A class of games possessing pure-strategy Nash equilibria
– R W Rosenthal
- 1973
|
|
87
|
The price of routing unsplittable flow
– B AWERBUCH, Y AZAR, L EPSTEIN
|
|
96
|
The Price of Anarchy of Finite Congestion Games
– George Christodoulou, Elias Koutsoupias
- 2005
|
|
142
|
The price of anarchy is independent of the network topology
– Tim Roughgarden
- 2002
|
|
37
|
A new model for selfish routing
– T Lücking, M Mavronicolas, B Monien, M Rode
|
|
71
|
Selfish Traffic Allocation for Server Farms
– Piotr Krysta, Artur Czumaj, Berthold Vöcking
- 2003
|
|
75
|
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
– Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis
- 2002
|
|
107
|
Congestion games with player specific pay-off functions
– I Milchtaich
- 1996
|
|
41
|
Computing Nash equilibria for scheduling on restricted parallel links
– Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
- 2004
|
|
583
|
Non-cooperative games
– J Nash
- 1951
|
|
43
|
On the price of anarchy and stability of correlated equilibria of linear congestion games
– George Christodoulou, Elias Koutsoupias
- 2005
|
|
230
|
Potential games
– D Monderer, L Shapley
- 1996
|
|
231
|
the internet
– C H Algorithms Papadimitriou, games
- 2001
|
|
44
|
Selfish load balancing and atomic congestion games
– Subhash Suri, Csaba D. T'oth, Yunhong Zhou
- 2004
|
|
55
|
Selfish Unsplittable Flows
– Dimitris Fotakis, Spyros Kontogiannis, Paul Spirakis
- 2004
|
