The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The complexity of pure Nash equilibria
Abstract
We investigate from the computational viewpoint multi-player games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLS-complete in general. We discuss implications to non-atomic congestion games, and we explore the scope of the potential function method for proving existence of pure Nash equilibria.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equilibrium points in n -person games
Nash, J. F. (1950) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.36.1.48 · Cited by 7,560
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
A class of games possessing pure-strategy Nash equilibria
Rosenthal, R. W. (1973) · International Journal of Game Theory · doi:10.1007/bf01737559 · Cited by 2,008
Studies in the Economics of Transportation.
R., D. J., Beckman, M., McGuire, C. B., Winsten, C. B., & Koopmans, T. (1956) · OR · doi:10.2307/3007560 · Cited by 1,613
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
On the complexity of the parity argument and other inefficient proofs of existence
Papadimitriou, C. H. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80063-7 · Cited by 778
Self-citationJohnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
Self-citationCongestion Games with Player-Specific Payoff Functions
Milchtaich, I. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0027 · Cited by 661
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
Garg, N., & Könemann, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743463 · Cited by 561
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C. H., & Shenker, S. J. (2003) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/872035.872088 · Cited by 523
Self-citation
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
The complexity of computing a Nash equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132527 · Cited by 470
Self-citationRoughgarden, T. (2010) · Communications of the ACM · doi:10.1145/1785414.1785439 · Cited by 288
Metadata
- Authors
- Fabrikant, A., Papadimitriou, C., & Talwar, K.
- Venue
- Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 604-612
- OpenAlex
- W2145297839
- Cited by
- 650
- References
- 18
- FWCI
- 53.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The complexity of pure Nash equilibria. https://app.cochat.ai/papers/10.1145/1007352.1007445
- The paper
- Fabrikant, A., Papadimitriou, C., & Talwar, K. (2004). The complexity of pure Nash equilibria. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1007352.1007445
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.