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

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

Stable Matchings, Optimal Assignments, and Linear Programming

Roth, Alvin E., Rothblum, Uriel G., Vande Vate, John H. · 1993 · Mathematics of Operations Research

Abstract

Vande Vate (1989) described the polytope whose extreme points are the stable (core) matchings in the Marriage Problem. Rothblum (1989) simplified and extended this result. This paper explores a corresponding linear program, its dual and consequences of the fact that the dual solutions have an unusually direct relation to the primal solutions. This close relationship allows us to provide simple proofs both of Vande Vate and Rothblum's results and of other important results about the core of marriage markets. These proofs help explain the structure shared by the marriage problem (without sidepayments) and the assignment game (with sidepayments). The paper further explores “fractional” matchings, which may be interpreted as lotteries over possible matches or as time-sharing arrangements. We show that those fractional matchings in the Stable Marriage Polytope form a lattice with respect to a partial ordering that involves stochastic dominance. Thus, all expected utility functions corresponding to the same ordinal preferences will agree on the relevant comparisons. Finally, we provide linear programming proofs of slightly stronger versions of known incentive compatibility results.

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.18.4.803

Cites

1 of 1 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 1 references

Cited by

See all 182

Metadata

Authors
Roth, A. E., Rothblum, U. G., & Vande Vate, J. H.
Venue
Mathematics of Operations Research
Published
1993-11
Volume
18
Issue
4
Pages
803-828
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
OpenAlex
W2168987865
Cited by
182
References
1
FWCI
7.07
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: Stable Matchings, Optimal Assignments, and Linear Programming. https://app.cochat.ai/papers/10.1287/moor.18.4.803
The paper
Roth, A. E., Rothblum, U. G., & Vande Vate, J. H. (1993). Stable Matchings, Optimal Assignments, and Linear Programming. Mathematics of Operations Research. https://doi.org/10.1287/moor.18.4.803

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.