Rank Gaps and the Size of the Core for Roommate Problems

Paula Jaramillo, Cagatay Kayi, Flip Klijn

Research output: Working paper

Abstract

This paper deals with roommate problems (Gale and Shapley, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study the assortativeness of stable matchings and the size of the core by means of maximal and average rank gaps. We provide upper bounds in terms of maximal and average disagreements in the agents’ rankings. Finally, we show that most of our bounds are tight.
Original languageEnglish (US)
Number of pages20
Volume196
StatePublished - 2017

Publication series

NameBarcelona GSE Working Papers Series
No.956

    Fingerprint

Cite this