Some things couples always wanted to know about stable matchings (but were afraid to ask)
- 111 Downloads
In this note we study the National Resident Matching Program (NRMP) algorithm in the US market for physicians. We report on two problems that concern the presence of couples, a feature explicitly incorporated in the new NRMP algorithm (cf. Roth and Peranson in Am Econ Rev 89:748–780, 1999). First, we show that the new NRMP algorithm may not find an existing stable matching, even when couples’ preferences are ‘responsive’, i.e., when Gale and Shapley’s (Am Math Monthly 69:9–15, 1962) deferred acceptance algorithm (on which the old NRMP algorithm is based) is applicable. Second, we demonstrate that the new NRMP algorithm may also be anipulated by couples acting as singles.
KeywordsMatching Stability Couples
JEL ClassificationC78 D78 J41
Unable to display preview. Download preview PDF.
- Checker A (1973) The National Intern and Resident Matching Program, 1966–1972. J Med Educ 48:107–109Google Scholar
- Klaus B, Klijn F (2005b) Corrigendum: stable matchings and preferences of couples. UFAE and IAE Working Paper 653–05, Universitat Autònoma de BarcelonaGoogle Scholar
- Roth AE, Sotomayor MAO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Econometric Society Monograph Series. Cambridge University Press, New YorkGoogle Scholar