The complexity of pure Nash equilibria
Top Cited Papers
- 13 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 604-612
- https://doi.org/10.1145/1007352.1007445
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- How bad is selfish routing?Journal of the ACM, 2002
- CONGESTION GAMES AND POTENTIALS RECONSIDEREDInternational Game Theory Review, 1999
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with ApplicationsSIAM Journal on Computing, 1997
- Potential GamesGames and Economic Behavior, 1996
- Congestion Games with Player-Specific Payoff FunctionsGames and Economic Behavior, 1996
- On the complexity of the parity argument and other inefficient proofs of existenceJournal of Computer and System Sciences, 1994
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman ProblemSIAM Journal on Computing, 1992
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- How easy is local search?Journal of Computer and System Sciences, 1988
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973