The Roommate Problem is More Stable than You Think - Sciences Po Access content directly
Preprints, Working Papers, ... Year : 2012

The Roommate Problem is More Stable than You Think

Pierre-André Chiappori
  • Function : Author
Alfred Galichon
Bernard Salanié
  • Function : Author

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.
Fichier principal
Vignette du fichier
roommate-problem.pdf (345.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03588302 , version 1 (24-02-2022)

Identifiers

Cite

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

Share

Gmail Facebook X LinkedIn More