A Fixed-Point Approach to Stable Matchings and Some Applications
The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that links together seemingly distant results, like the stable marriage theorem of Gale and Shapley, the Mendelsohn-Dulmage theorem, the Kundu-Lawler theorem, Tarski's fixed-point theorem, the Cantor-Bernstein theorem, Pym's linking theorem, or the monochromatic path theorem of Sands et al. In this framework, we formulate a matroid-generalization of the stable marriage theorem and study the lattice structure of generalized stable matchings. Based on the theory of lattice polyhedra and blocking polyhedra, we extend results of Vande Vate and Rothblum on the bipartite stable matching polytope.
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
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
A lattice-theoretical fixpoint theorem and its applications
Tarski, A. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.285 · Cited by 2,704
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · American Mathematical Monthly · doi:10.2307/2312726 · Cited by 2,082
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis
Roth, A. E., & Sotomayor, M. A. O. (1990) · Cambridge University Press eBooks · doi:10.1017/ccol052139015x · Cited by 1,340
Job Matching, Coalition Formation, and Gross Substitutes
Kelso, A. S., & Crawford, V. P. (1982) · Econometrica · doi:10.2307/1913392 · Cited by 1,307
The evolution of the labor market for medical interns and residents: A case study in game theory
Roth, A. E. (1984) · Journal of Political Economy · doi:10.1086/261272 · Cited by 1,219
Blocking and anti-blocking pairs of polyhedra
Fulkerson, D. R. (1971) · Mathematical Programming · doi:10.1007/bf01584085 · Cited by 538
Job Matching with Heterogeneous Firms and Workers
Crawford, V. P., & Knoer, E. M. (1981) · Econometrica · doi:10.2307/1913320 · Cited by 484
Stability and Polarization of Interests in Job Matching
Roth, A. E. (1984) · Econometrica · doi:10.2307/1911460 · Cited by 363
The Lattice Structure of the Set of Stable Matchings with Multiple Partners
Blair, C. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.4.619 · Cited by 217
Fulkerson, D. R. (1972) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(72)90032-9 · Cited by 216
Linear programming brings marital bliss
Vande Vate, J. H. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90041-2 · Cited by 172
Characterization of stable matchings as extreme points of a polytope
Rothblum, U. G. (1992) · Mathematical Programming · doi:10.1007/bf01586041 · Cited by 139
On a characterization of stable matchings
Adachi, H. (2000) · Economics Letters · doi:10.1016/s0165-1765(99)00241-4 · Cited by 120
A new fixed point approach for stable networks and stable marriages
Feder, T. (1992) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(92)90048-n · Cited by 107
A class of multipartner matching markets with a strong lattice structure
Alkan, A. U. (2002) · Economic Theory · doi:10.1007/s001990100179 · Cited by 102
Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
Roth, A. E. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.3.379 · Cited by 100
A New Approach to Stable Matching Problems
Subramanian, A. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539789169483 · Cited by 77
THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES
Gale, D. (2001) · International Game Theory Review · doi:10.1142/s0219198901000373 · Cited by 60
On the stable b-matching polytope
Fleiner, T. (2003) · Mathematical Social Sciences · doi:10.1016/s0165-4896(03)00074-x · Cited by 35
Self-citation
Cited by
Hatfield, J. W., & Milgrom, P. R. (2005) · American Economic Review · doi:10.1257/0002828054825466 · Cited by 788
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
School choice with controlled choice constraints: Hard bounds versus soft bounds
Ehlers, L., Hafalir, I. E., Yenmez, M. B., & Yildirim, M. A. (2014) · Journal of Economic Theory · doi:10.1016/j.jet.2014.03.004 · Cited by 283
Metadata
- Authors
- Fleiner, T.
- Venue
- Mathematics of Operations Research
- Published
- 2003-02
- Volume
- 28
- Issue
- 1
- Pages
- 103-126
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W1978696336
- Cited by
- 291
- References
- 22
- FWCI
- 18.29
- 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.