The Complexity of Pure Nash Equilibria (2004)

Cached

Download Links

by Alex Fabrikant , Christos Papadimitriou , Kunal Talwar
Citations:145 - 6 self

Documents Related by Co-Citation

406 A class of games possessing pure-strategy nash equilibria – R W Rosenthal - 1973
631 Worst-case equilibria – Elias Koutsoupias, Christos Papadimitriou - 1999
106 The price of routing unsplittable flow – Baruch Awerbuch, Yossi Azar, Amir Epstein - 2005
516 How bad is selfish routing? – Tim Roughgarden, Éva Tardos - 2002
195 How easy is local search – D S Johnson, C H Papadimitriou, M Yannakakis - 1988
122 The Price of Anarchy of Finite Congestion Games – George Christodoulou, Elias Koutsoupias - 2005
140 Congestion games with player-specific payoff functions – I Milchtaich - 1996
160 Tight bounds for worst-case equilibria – Artur Czumaj, Berthold Vöcking - 2002
178 The price of anarchy is independent of the network topology – Tim Roughgarden - 2002
800 Non-cooperative games – J F Nash - 1951
353 Potential games – D Monderer, L S Shapley - 1996
82 Convergence time to nash equilibria – Eyal Even-dar, Alex Kesselman, Yishay Mansour - 2003
227 The complexity of computing a Nash equilibrium – Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou - 2006
68 Sink equilibria and convergence – Michel Goemans, Vahab Mirrokni, Adrian Vetta - 2005
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
85 Simple local search problems that are hard to solve – A A Schäffer, M Yannakakis - 1991
30 Fast and Compact: A Simple Class of Congestion Games – Samuel Ieong, Robert Mcgrew, Eugene Nudelman, Yoav Shoham, Qixiang Sun - 2005
223 Graphical Models for Game Theory – Michael Kearns, Michael L. Littman, Satinder Singh - 2001
130 Complexity Results about Nash Equilibria – Vincent Conitzer, Tuomas Sandholm - 2002