IMASL 20939
INSTITUTO DE MATEMATICA APLICADA DE SAN LUIS "PROF. EZIO MARCHI"
Unidad Ejecutora - UE
artículos
Título:
Hedonic games related to many-to-one matching problems
Autor/es:
J. C. CESCO
Revista:
SOCIAL CHOICE AND WELFARE
Editorial:
Springer Verlag
Referencias:
Año: 2012 vol. 39 p. 737 - 749
ISSN:
0176-1714
Resumen:
We consider the existence problem of stable matchings in many-to-onematching problems. Unlike other approaches which use algorithmic techniques to givenecessary and sufficient conditions, we adopt a game theoretic point of view.We firstassociate, with each many-to-one matching problem, a hedonic game to take advantageof recent results guaranteeing the existence of core-partitions for that class ofgames, to build up our conditions. The main result states that a many-to-one matchingproblem, with no restrictions on individual preferences, has stable∗ matchings if andonly if a related hedonic game is pivotally balanced. In the case that the preferences in
