A probabilistic version of the stable marriage problem

DOI10.1007/BF02218437MaRDI QIDQ1053597zbMATH OpenOpenAlexFDO

Authors 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

23, 161-169 (1983)assignment problemcombinatoricscomputational experiencepreference informationprobabilistic stable marriage problemtau-stability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053597)