Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/108352
Authors: 
Biró, Péter
Iñarra, Elena
Molis, Elena
Year of Publication: 
2014
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2014/22
Abstract: 
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.
Subjects: 
roommate problem
almost stable
maximum stable
absorbing set
JEL: 
C61
C63
C71
C78
ISBN: 
978-615-5447-39-6
Document Type: 
Working Paper

Files in This Item:
File
Size
531.78 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.