TOPICS
Search

Stable Marriage


A stable marriage is a one-to-one matching between two equally sized sets of participants, each of whom ranks the participants in the other set, such that there is no blocking pair. A blocking pair consists of two participants who are not matched to each other but each prefer the other to their assigned partner. A stable marriage exists for every instance with complete strict preference lists (Gale and Shapley 1962).

The stable marriage problem asks for a stable marriage for a given collection of preference lists.

With n>=1 participants on each side and complete strict preference lists, the number of distinct stable marriages is less than 2.81^n (Ghorbani and Mnich 2026). The proof uses weights whose admissibility is checked by exact rational arithmetic and certified bounds for the exponential function.


See also

Hall's Marriage Theorem, Matching, Stable Marriage Problem

Explore with Wolfram|Alpha

References

Gale, D. and Shapley, L. S. "College Admissions and the Stability of Marriage." Amer. Math. Monthly 69, 9-14, 1962.Ghorbani, E. and Mnich, M. "A 2.81^n Upper Bound on the Number of Stable Matchings." 4 Nov 2026. https://arxiv.org/abs/2611.06494v1.

Cite this as:

Weisstein, Eric W. "Stable Marriage." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/StableMarriage.html

Subject classifications