Documents Related by Co-Citation

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