Scholion.ai

Near-Feasible Stable Matchings with Couples

Thành Nguyen, Rakesh Vohra

American Economic Review · 2018 · Volume 108 · Issue 11

DOI: 10.1257/aer.20141188

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.

Keywords

Bargaining Theory, Matching Theory, Market Design, Analysis of Health Care Markets, Labor Contracts, Professional Labor Markets, Occupational Licensing

Enable JavaScript for citation tools and additional paper interactions.