The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The stable marriage problem
Open accessAbstract
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.
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
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
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
An efficient algorithm for the “stable roommates” problem
Irving, R. W. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90033-1 · Cited by 431
Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions
Roth, A. (2007) · National Bureau of Economic Research · doi:10.3386/w13225 · Cited by 392
Deferred acceptance algorithms: history, theory, practice, and open questions
Roth, A. E. (2008) · International Journal of Game Theory · doi:10.1007/s00182-008-0117-6 · Cited by 372
A benchmarking study of embedding-based entity alignment for knowledge graphs
Sun, Z., Zhang, Q., Hu, W., Wang, C., Chen, M., Akrami, F., & Li, C. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407828 · Cited by 265
Metadata
- Authors
- McVitie, D. G., & Wilson, L. B.
- Venue
- Communications of the ACM
- Published
- 1971-07
- Volume
- 14
- Issue
- 7
- Pages
- 486-490
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2017008045
- Cited by
- 386
- References
- 1
- FWCI
- 5.39
- Type
- journal article
- Language
- en
- Open access
- bronze
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.