Replication data for: Near-Feasible Stable Matchings with Couples

Thành Nguyen & Rakesh Vohra
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...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.