arXiv · math/9201303
Stable husbands
Abstract
Suppose $n$ boys and $n$ girls rank each other at random. We show that any particular girl has at least $({1\over 2}-ε) \ln n$ and at most $(1+ε)\ln n$ different husbands in the set of all Gale/Shapley stable matchings defined by these rankings, with probability approaching 1 as $n \to \infty$, if $ε$ is any positive constant. The proof emphasizes general methods that appear to be useful for the analysis of many other combinatorial algorithms.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Donald E. Knuth, Rajeev Motwani, Boris Pittel. 1990-01-01. Stable husbands. https://searcharxiv.com/abs/math/9201303
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.