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

Bettina Klaus, Flip Klijn, Jordi Massó

Producció científica: Document de treball

1 Descàrregues (Pure)

Resum

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.
Idioma originalAnglès
EditorBSE Working Papers
Estat de la publicacióPublicada - de nov. 2005

Sèrie de publicacions

NomBSE Working Paper
Núm.78

Fingerprint

Navegar pels temes de recerca de 'Some things couples always wanted to know about stable matchings (but were afraid to ask)'. Junts formen un fingerprint únic.

Com citar-ho