Documents Related by Co-Citation

618 Worst-case equilibria – Elias Koutsoupias, Christos Papadimitriou - 1999
157 Tight bounds for worst-case equilibria – Artur Czumaj, Berthold Vöcking - 2002
119 The price of selfish routing – M Mavronicolas, P Spirakis - 2001
288 the Internet – Games Algorithms - 2001
168 The price of anarchy is independent of the network topology – Tim Roughgarden - 2002
76 Selfish Traffic Allocation for Server Farms – Piotr Krysta, Artur Czumaj, Berthold Vöcking - 2003
555 Algorithmic mechanism design – Noam Nisan, Amir Ronen - 1999
391 A class of games possessing pure-strategy Nash equilibria – R W Rosenthal - 1973
59 Designing networks for selfish users is hard – Tim Roughgarden - 2001
435 Some theoretical aspects of road traffic research – J G Wardrop - 1952
796 Non-cooperative Games – J Nash - 1951
180 Competitive Routing in Multi-User Communication Networks – Ariel Orda, Raphael Rom, Nahum Shimkin - 1993
112 The tra c assignment problem for a general network – S C Dafermos, F T Sparrow - 1969
107 Stackelberg scheduling strategies – Tim Roughgarden - 2001
185 Truthful Mechanisms for One-Parameter Agents – Aron Archer, Eva Tardos
98 Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auction – Adrian Vetta - 2002
190 Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines – Scott Shenker - 1994
248 Sharing the Cost of Multicast Transmissions – Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker - 2001
54 Approximate Equilibria and Ball Fusion – Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis - 2002