10.17889/E110124
Nguyen, Thành
Vohra, Rakesh
Replication data for: Near-Feasible Stable Matchings with Couples
ICPSR Inter-university Consortium for Political and Social Research
2018
10.1257/aer.20141188
10.1257/aer.20141188
V0
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.