We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Near-Feasible Stable Matchings with Couples.
- Authors
Nguyen, Thành; Vohra, Rakesh
- Abstract
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)
- Subjects
NATIONAL Resident Matching Program (U.S.); MEDICAL students; MEDICAL education; TEACHING hospitals; RESIDENTS (Medicine)
- Publication
American Economic Review, 2018, Vol 108, Issue 11, p3154
- ISSN
0002-8282
- Publication type
Article
- DOI
10.1257/aer.20141188