The DOI matches its Crossref record.
1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem
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
Cited by
(2015) · Cited by 2,857
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
The Efficient Allocation of Individuals to Positions
Hylland, A., & Zeckhauser, R. (1979) · Journal of Political Economy · doi:10.1086/260757 · Cited by 549
Majorization, doubly stochastic matrices, and comparison of eigenvalues
Ando, T. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90580-6 · Cited by 305
Towards Safety and Sustainability: Designing Local Recommendations for Post-pandemic World
Patro, G. K., Chakraborty, A., Banerjee, A., & Ganguly, N. (2020) · Fourteenth ACM Conference on Recommender Systems · doi:10.1145/3383313.3412251 · Cited by 21
Metadata
- Authors
- Neumann, J. V.
- Venue
- Contributions to the Theory of Games (AM-28), Volume II
- Publisher
- Princeton University Press
- Published
- 1953-12-31
- Pages
- 5-12
- OpenAlex
- W2493312408
- Cited by
- 483
- References
- 0
- FWCI
- 17.00
- Type
- book chapter
- 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: 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem. https://app.cochat.ai/papers/10.1515/9781400881970-002
- The paper
- Neumann, J. V. (1953). 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem. Contributions to the Theory of Games (AM-28), Volume II. https://doi.org/10.1515/9781400881970-002
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.
