Some things couples always wanted to know about stable matchings (but were afraid to ask)

Bettina Klaus, Flip Klijn, Jordi Massó

Research output: Contribution to journalArticleResearchpeer-review

13 Citations (Scopus)

Abstract

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. © 2006 Springer-Verlag.
Original languageEnglish
Pages (from-to)175-184
JournalReview of Economic Design
Volume11
DOIs
Publication statusPublished - 1 Jan 2007

Keywords

  • Couples
  • Matching
  • Stability

Fingerprint Dive into the research topics of 'Some things couples always wanted to know about stable matchings (but were afraid to ask)'. Together they form a unique fingerprint.

Cite this