The Roommate Problem is More Stable than You Think

Pierre-André Chiappori, Alfred Galichon () and Bernard Salanié
Additional contact information
Alfred Galichon: ECON - Département d'économie (Sciences Po) - Sciences Po - Sciences Po - CNRS - Centre National de la Recherche Scientifique

Working Papers from HAL

Abstract: Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and tastes (types). As a consequence, when the number of individuals of any given type is large enough there always exist quasi-stable matchings: a stable matching can be restored with minimal policy intervention. Our results build on an analogy with an associated bipartite problem; it follows that the tools crafted in empirical studies of the marriage problem can easily be adapted to the roommate problem.

Keywords: Matching; Roommate Problem; Stability (search for similar items in EconPapers)
Date: 2012-08-01
Note: View the original document on HAL open archive server: https://sciencespo.hal.science/hal-03588302
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
https://sciencespo.hal.science/hal-03588302/document (application/pdf)

Related works:
Working Paper: The Roommate Problem - Is More Stable Than You Think (2014)
Working Paper: The Roommate Problem is More Stable than You Think (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:wpaper:hal-03588302

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().