Some Things Couples always wanted to know about Stable Matchings (but were afraid to ask)

Details

Serval ID
serval:BIB_E27C6078F373
Type
Article: article from journal or magazin.
Collection
Publications
Title
Some Things Couples always wanted to know about Stable Matchings (but were afraid to ask)
Journal
Review of Economic Design
Author(s)
Klaus B., Klijn F., Masso J.
ISSN
1434-4742
Publication state
Published
Issued date
2007
Peer-reviewed
Oui
Volume
11
Number
3
Pages
175-184
Language
english
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.
Keywords
Matching, Stability, Couples
Create date
13/04/2010 14:08
Last modification date
20/08/2019 16:06
Usage data