Near-Feasible Stable Matchings with Couples
2018 ◽
Vol 108
(11)
◽
pp. 3154-3169
◽
Keyword(s):
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. (JEL C78, D47, I11, J41, J44)
1999 ◽
Vol 38
(1)
◽
pp. 55-70
◽
2018 ◽
Vol 19
(2)
◽
2020 ◽
Vol 34
(02)
◽
pp. 1830-1837
◽
2007 ◽
Vol 28
(2)
◽
pp. 171-177
◽
2019 ◽
Vol 12
(2)
◽
pp. 116-123
◽
2015 ◽
Vol 7
(3)
◽
pp. 241-258
◽
Keyword(s):
2019 ◽
Vol 8
(5)
◽
pp. 1083