Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/108352 
Erscheinungsjahr: 
2014
Schriftenreihe/Nr.: 
IEHAS Discussion Papers No. MT-DP - 2014/22
Verlag: 
Hungarian Academy of Sciences, Institute of Economics, Centre for Economic and Regional Studies, Budapest
Zusammenfassung: 
The aim of this paper is to propose a new solution for the roommate problem with strict references. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2]) and maximum stable matchings (Tan [30] [32]). We find that almost stable matchings are incompatible with the other two solutions. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an efficient algorithm for computing one of them. The outcome of the algorithm belongs to an absorbing set.
Schlagwörter: 
roommate problem
almost stable
maximum stable
absorbing set
JEL: 
C61
C63
C71
C78
ISBN: 
978-615-5447-39-6
Dokumentart: 
Working Paper

Datei(en):
Datei
Größe
531.78 kB





Publikationen in EconStor sind urheberrechtlich geschützt.