The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On a conjecture by gale about one-sided matching problems
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
Cited by
School Choice: A Mechanism Design Approach
Abdulkadiroğlu, A., & Sönmez, T. (2003) · American Economic Review · doi:10.1257/000282803322157061 · Cited by 1,568
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Budish, E. (2011) · Journal of Political Economy · doi:10.1086/664613 · Cited by 766
A New Solution to the Random Assignment Problem
Bogomolnaia, A., & Moulin, H. (2001) · Journal of Economic Theory · doi:10.1006/jeth.2000.2710 · Cited by 726
A Tale of Two Mechanisms: Student Placement
Balinski, M., & Sönmez, T. (1999) · Journal of Economic Theory · doi:10.1006/jeth.1998.2469 · Cited by 565
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
Metadata
- Authors
- Zhou, L.
- Venue
- Journal of Economic Theory
- Publisher
- Elsevier BV
- Published
- 1990-10
- Volume
- 52
- Issue
- 1
- Pages
- 123-135
- ISSN
- 0022-0531 (ISSN-L)
- OpenAlex
- W2076154639
- Cited by
- 235
- References
- 2
- FWCI
- 0.00
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On a conjecture by gale about one-sided matching problems. https://app.cochat.ai/papers/10.1016/0022-0531(90)90070-z
- The paper
- Zhou, L. (1990). On a conjecture by gale about one-sided matching problems. Journal of Economic Theory. https://doi.org/10.1016/0022-0531(90)90070-z
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.