HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The Roommate Problem is More Stable than You Think

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal-sciencespo.archives-ouvertes.fr/hal-03588302
Contributor : Spire Sciences Po Institutional Repository Connect in order to contact the contributor
Submitted on : Thursday, February 24, 2022 - 4:48:34 PM
Last modification on : Friday, March 25, 2022 - 3:57:40 AM

File

roommate-problem.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pierre-André Chiappori, Alfred Galichon, Bernard Salanié. The Roommate Problem is More Stable than You Think. 2012. ⟨hal-03588302⟩

Share

Metrics

Record views

1

Files downloads

4