The Stability of the Roommate Problem Revisited
Data(s) |
25/01/2012
25/01/2012
01/09/2007
|
---|---|
Resumo |
The lack of stability in some matching problems suggests that alternative solution concepts to the core might be applied to find predictable matchings. We propose the absorbing sets as a solution for the class of roommate problems with strict preferences. This solution, which always exists, either gives the matchings in the core or predicts some other matchings when the core is empty. Furthermore, it satisfies an interesting property of outer stability. We also characterize the absorbing sets, determine their number and, in case of multiplicity, we find that they all share a similar structure. |
Identificador |
http://hdl.handle.net/10810/6482 RePEc:ehu:ikerla:200730 |
Idioma(s) |
eng |
Relação |
Ikerlanak 2007.30 |
Direitos |
info:eu-repo/semantics/openAccess |
Palavras-Chave | #roommate problem #core #absorbing sets |
Tipo |
info:eu-repo/semantics/workingPaper |