A probabilistic version of the stable marriage problem

DOI10.1007/BF02218437zbMath0517.90038OpenAlexW2086614829MaRDI QIDQ1053597

Stephen Y. Itoga

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02218437

zbMATH Keywords

combinatoricsassignment problemcomputational experiencepreference information23, 161-169 (1983)probabilistic stable marriage problemtau-stability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A Generalization of the Stable Marriage Problem
• The Upper Bound for the Stable Marriage Problem
• Stable marriage assignment for unequal sets
• An analysis of the stable marriage assignment algorithm
• College Admissions and the Stability of Marriage

This page was built for publication: A probabilistic version of the stable marriage problem