The complexity of pure Nash equilibria

By Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar. Symposium on the Theory of Computing, 2004

700 citations recorded by the source corpus.

Subfields: Management Science and Operations Research, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/71573900a6f2b934c5fd5eaf0e57958dc53527f6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Management Science and Operations Research

1. É. Tardos
2. Tim Roughgarden
3. Christos H. Papadimitriou
4. Anirban Dasgupta
5. Elliot Anshelevich
6. Tom Wexler
7. Constantinos Daskalakis
8. Jon M. Kleinberg

In Statistical and Nonlinear Physics

1. É. Tardos
2. Anirban Dasgupta
3. Jon M. Kleinberg
4. Jure Leskovec
5. Christos H. Papadimitriou
6. Constantinos Daskalakis
7. Charu C. Aggarwal
8. Manuel Gomez-Rodriguez

Citations in the corpus

• Network games (2004, background): “There has been progress in the area, mostly focused on market equilibria [7, 9, 22], but also including other problems, such as routing [11].”
• The price of stability for network design with fair cost allocation (2004, methodology): “Proof: Consider the Nash equilibrium obtained by Fabrikant et al [7] via a minimum cost flow computation.”
• The complexity of computing a Nash equilibrium (2009, background): “The corresponding complexity class, PLS for “polynomial local search,” had already been defined in [32] and contains many important complete problems, including certain game-theoretic problems [26].”