The Roommate Problem Is More Stable Than You Think
Chiappori
Pierre A.
author
Columbia University. Economics
Galichon
Alfred
author
Salanie
Bernard
author
Columbia University. Economics
Columbia University. Economics
originator
contributor
text
Working papers
New York
Department of Economics, Columbia University
2012
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.
Economics
Department of Economics Discussion Papers
1213-09
http://hdl.handle.net/10022/AC:P:15211
English
NNC
NNC
2012-11-07 12:07:46 -0500
2012-11-07 12:11:06 -0500
9213
eng