Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/159813 
Authors: 
Year of Publication: 
2014
Series/Report no.: 
Quaderni - Working Paper DSE No. 975
Publisher: 
Alma Mater Studiorum - Università di Bologna, Dipartimento di Scienze Economiche (DSE), Bologna
Abstract: 
Gale and Shapley (1962) proposed that there is a similar game to the marriage problem called "the roommate problem". And, they showed that unlike the marriage problem, the roommate problem may have unstable solutions. In other words, the stability theorem fails for the roommate problem. In this paper, we propose a new mechanism for the roommate problem. The mechanism is successful in determining the reason of instability in our game scenario. And, we show that our mechanism implements the full set of stable matchings in the existence of stability, and it ends up with Pareto Optimal matching in the instance of instability.
JEL: 
C78
D71
D78
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Working Paper

Files in This Item:
File
Size
361.13 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.