Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 291

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

A Fixed-Point Approach to Stable Matchings and Some Applications

Fleiner, Tamás·2003·Mathematics of Operations Research
DOI 10.1287/moor.28.1.103.14256
Open this paper in CoChat — free account

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/moor.28.1.103.14256

Cites

22 of 22 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 22 references

Cited by

See all 291

Metadata

Authors
Fleiner, T.
Venue
Mathematics of Operations Research
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Published
2003-02
Volume
28
Issue
1
Pages
103-126
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
DOI
10.1287/moor.28.1.103.14256
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Fixed-Point Approach to Stable Matchings and Some Applications. https://app.cochat.ai/papers/10.1287/moor.28.1.103.14256
The paper
Fleiner, T. (2003). A Fixed-Point Approach to Stable Matchings and Some Applications. Mathematics of Operations Research. https://doi.org/10.1287/moor.28.1.103.14256

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.