Replication data for: Near-Feasible Stable Matchings with Couples
- Nguyen, Thành
- Vohra, Rakesh
AbstractThe 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.
Is supplement to
DOI: 10.1257/aer.20141188 (Text)
Nguyen, Thành, and Rakesh Vohra. “Near-Feasible Stable Matchings with Couples.” American Economic Review 108, no. 11 (November 2018): 3154–69. https://doi.org/10.1257/aer.20141188.
- ID: 10.1257/aer.20141188 (DOI)
Update Metadata: 2020-05-18 | Issue Number: 2 | Registration Date: 2019-10-12