On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women

DOI10.1287/moor.2017.0917zbMath1435.91128arXiv1701.08900OpenAlexW2583885016WikidataQ129225087 ScholiaQ129225087MaRDI QIDQ5219711

Boris G. Pittel

Publication date: 12 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.08900

zbMATH Keywords

asymptoticsstable matchingrandom preferences

Mathematics Subject Classification ID

Matching models (91B68)

Related Items (5)

Review of the theory of stable matchings and contract systems ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ What matters in school choice tie-breaking? How competition guides design ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On likely solutions of a stable marriage problem
• On random stable partitions
• The Average Number of Stable Matchings
• On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem
• On the Likely Number of Solutions for the Stable Marriage Problem
• The Complexity of Counting Stable Marriages
• An analysis of the stable marriage assignment algorithm
• Stable husbands
• College Admissions and the Stability of Marriage

This page was built for publication: On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women