Documents Related by Co-Citation

483 Worst-case equilibria – Elias Koutsoupias, Christos Papadimitriou - 1999
131 Tight bounds for worst-case equilibria – Artur Czumaj, Berthold Vöcking - 2002
99 P.G.: The price of selfish routing – M Mavronicolas, Spirakis - 2007
231 the internet – C H Algorithms Papadimitriou, games - 2001
480 Algorithmic mechanism design – Noam Nisan, Amir Ronen - 1999
71 Selfish Traffic Allocation for Server Farms – Piotr Krysta, Artur Czumaj, Berthold Vöcking - 2003
142 The price of anarchy is independent of the network topology – Tim Roughgarden - 2002
148 Competitive Routing in Multi-User Communication Networks – Ariel Orda, Raphael Rom, Nahum Shimkin - 1993
174 Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines – Scott Shenker - 1994
307 A class of games possessing pure-strategy Nash equilibria – R W Rosenthal - 1973
82 Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auction – Adrian Vetta - 2002
89 Stackelberg scheduling strategies – Tim Roughgarden - 2001
217 Sharing the Cost of Multicast Transmissions – Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker - 2001
583 Non-cooperative games – J Nash - 1951
53 Designing networks for selfish users is hard – Tim Roughgarden - 2001
307 Some theoretical aspects of road traffic research – J Wardrop - 1952
52 Capacity Allocation under Noncooperative Routing – Yannis A. Korilis, Aurel A. Lazar, Ariel Orda - 1997
39 Avoiding the Braess Paradox in Noncooperative Networks – Yannis A. Korilis, Aurel A. Lazar, Ariel Orda - 1997
89 The traffic assignment problem for a general network – S C Dafermos, F T Sparrow - 1969