Near-Feasible Stable Matchings with Couples.
Near-Feasible Stable Matchings with Couples.
复制标题
与情侣的近乎可行的稳定匹配。
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
R. Vohra
中科院分区：
文献类型：
--
作者：
Thành Nguyen;R. Vohra
国家住院医师匹配计划寻求医学生与教学医院的稳定匹配。对于情侣来说，稳定的配对并不需要存在。然而，对于任何学生的偏好，我们表明匹配问题的每个实例都有一个“附近”具有稳定匹配的实例。附近的例子是通过扰乱医院的能力得到的。在这种扰动中，总容量永远不会减少，最多只能增加
The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we show that each instance of a matching problem has a "nearby" instance with a stable matching. The nearby instance is obtained by perturbing the capacities of the hospitals. In this perturbation, aggregate capacity is never reduced and can increase by at most
four. The capacity of each hospital never changes by more than two.