The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Equilibrium Points of Bimatrix Games
Abstract
An algebraic proof is given of the existence of equilibrium points for bimatrix (or two-person, non-zero-sum) games. The proof is constructive, leading to an efficient scheme for computing an equilibrium point. In a nondegenerate case, the number of equilibrium points is finite and odd. The proof is valid for any ordered field.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Nash, J. (1951) · The Annals of Mathematics · doi:10.2307/1969529 · Cited by 7,002
Management Models and Industrial Applications of Linear Programming
Williams, K. B., Charnes, A., & Cooper, W. W. (1962) · OR · doi:10.2307/3006897 · Cited by 648
Cited by
Harker, P. T., & Pang, J.-S. (1990) · Mathematical Programming · doi:10.1007/bf01582255 · Cited by 1,817
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Numerical Continuation Methods
Allgower, E. L., & Georg, K. (1990) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61257-2 · Cited by 1,269
Engineering and Economic Applications of Complementarity Problems
Ferris, M. C., & Pang, J. S. (1997) · SIAM Review · doi:10.1137/s0036144595285963 · Cited by 1,081
The Complexity of Computing a Nash Equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · SIAM Journal on Computing · doi:10.1137/070699652 · Cited by 921
Solving Systems of Polynomial Equations
Sturmfels, B. (2002) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/097 · Cited by 792
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
Settling the complexity of computing two-player Nash equilibria
Chen, X., Deng, X., & Teng, S.-H. (2009) · Journal of the ACM · doi:10.1145/1516512.1516516 · Cited by 560
Jointly Constrained Biconvex Programming
Al-Khayyal, F. A., & Falk, J. E. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.2.273 · Cited by 553
Settling the Complexity of Two-Player Nash Equilibrium
Chen, X., & Deng, X. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.69 · Cited by 486
Extension of GAMS for complementarity problems arising in applied economic analysis
Rutherford, T. F. (1995) · Journal of Economic Dynamics and Control · doi:10.1016/0165-1889(94)00831-2 · Cited by 476
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
Dual Sales Channel Management with Service Competition
Chen, K.-Y., Kaya, M., & Özer, Ö. (2008) · Manufacturing & Service Operations Management · doi:10.1287/msom.1070.0177 · Cited by 457
Complementarity problems in GAMS and the PATH solver
Ferris, M. C., & Munson, T. S. (2000) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(98)00092-x · Cited by 400
Aghassi, M., & Bertsimas, D. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0686-0 · Cited by 333
Mean Field Multi-Agent Reinforcement Learning
Yang, Y., Luo, R., Li, M., Zhou, M. Q., Zhang, W., & Wang, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05438 · Cited by 286
A new method for a class of linear variational inequalities
He, B. (1994) · Mathematical Programming · doi:10.1007/bf01581141 · Cited by 162
Metadata
- Authors
- Lemke, C. E., & Howson, Jr.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1964-06
- Volume
- 12
- Issue
- 2
- Pages
- 413-423
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2089649903
- Cited by
- 1,231
- References
- 2
- FWCI
- 1.65
- Type
- journal article
- 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
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.