The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Lattice Structure of the Set of Stable Matchings with Multiple Partners
Abstract
We continue recent work on the matching problem for firms and workers, and show that, for a suitable ordering, the set of stable matchings is a lattice.
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
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
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 Fixed-Point Approach to Stable Matchings and Some Applications
Fleiner, T. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.103.14256 · Cited by 291
Stability in Supply Chain Networks
Ostrovsky, M. (2008) · American Economic Review · doi:10.1257/aer.98.3.897 · Cited by 288
Metadata
- Authors
- Blair, C.
- Venue
- Mathematics of Operations Research
- Published
- 1988-11
- Volume
- 13
- Issue
- 4
- Pages
- 619-628
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2127529398
- Cited by
- 217
- References
- 1
- FWCI
- 8.02
- 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: The Lattice Structure of the Set of Stable Matchings with Multiple Partners. https://app.cochat.ai/papers/10.1287/moor.13.4.619
- The paper
- Blair, C. (1988). The Lattice Structure of the Set of Stable Matchings with Multiple Partners. Mathematics of Operations Research. https://doi.org/10.1287/moor.13.4.619
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.