A new solution concept for the roommate problem

Biró, Péter and Inarra, E. and Molis, E. (2016) A new solution concept for the roommate problem. MATHEMATICAL SOCIAL SCIENCES, 79. pp. 74-82. ISSN 0165-4896

Preview

Text BIM2016mss_last.pdf Download (706kB) | Preview

Abstract

Abstract The aim of this paper is to propose a new solution concept for the roommate problem with strict preferences. We introduce maximum irreversible matchings and consider almost stable matchings (Abraham et al., 2006) and maximum stable matchings (Tan 1990, 1991b). These solution concepts are all core consistent. We find that almost stable matchings are incompatible with the other two concepts. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which we call Q -stable matchings. We construct an efficient algorithm for computing one element of this set for any roommate problem. We also show that the outcome of our algorithm always belongs to an absorbing set (Inarra et al., 2013).

Actions (login required)

Edit Item