TY - JOUR
T1 - Some things Couples always wanted to know about Stable Matchings (but were afraid to ask)
AU - Klaus, B.E.
AU - Klijn, F.
AU - Masso, J.
PY - 2007/1/1
Y1 - 2007/1/1
N2 - 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.
AB - 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.
U2 - 10.1007/s10058-006-0017-9
DO - 10.1007/s10058-006-0017-9
M3 - Article
SN - 1434-4742
VL - 11
SP - 175
EP - 184
JO - Review of Economic Design
JF - Review of Economic Design
ER -