The stable marriage problem

D. G. McVitie · L. B. Wilson

386 citations0/0 files storedCommunications of the ACM

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Voting Systems Advanced Combinatorial Mathematics Constraint Satisfaction and Optimization

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 386 citations exist upstream.

References

1962College Admissions and the Stability of Marriage

Cited by

2008Deferred acceptance algorithms: history, theory, practice, and open questions 1991A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom.1987An efficient algorithm for the “optimal” stable marriage 1970Stable marriage assignment for unequal sets 1986The Complexity of Counting Stable Marriages 1992Chapter 16 Two-sided matching 2001Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications 1987Three Fast Algorithms for Four Problems in Stable Marriage

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.