带约束的稳定匹配近可行解
Near-Feasible Stable Matchings with Couples.
机构信息
Krannert School of Management, Purdue University, 403 W. State Street, West Lafayette, IN 47906.
Economics Department, University of Pennsylvania, 451 McNeil Building, 3718 Locust Walk, Philadelphia, PA 19104.
出版信息
Am Econ Rev. 2018 Nov;108(11):3154–69.
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.
国家住院医师匹配项目旨在为医学生和教学医院寻求稳定的匹配。对于夫妻来说，稳定匹配不一定存在。然而，对于任何学生的偏好，我们表明匹配问题的每个实例都有一个具有稳定匹配的“附近”实例。通过改变医院的容量来获得附近的实例。在这种扰动中，总容量从未减少，最多可以增加四个。每个医院的容量变化不会超过两个。
Zotero 插件