Rank Gaps and the Size of the Core for Roommate Problems

Paula Jaramillo; Cagatay Kayi; Flip Klijn

Rank Gaps and the Size of the Core for Roommate Problems

Paula Jaramillo, Cagatay Kayi, Flip Klijn

Faculty of Economics Research Group

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.

Translated title of the contribution	Brechas de clasificación y el tamaño del núcleo para los problemas de compañeros de cuarto
Original language	English (US)
Number of pages	20
Volume	196
State	Published - 2017

Publication series

Name	Barcelona GSE Working Papers Series
No.	956

Access to Document

http://www.barcelonagse.eu/research/working-papers/rank-gaps-and-size-core-roommate-problems

Cite this

@techreport{bfae104371cf45dc9d1719a79cc4bf35,

title = "Rank Gaps and the Size of the Core for Roommate Problems",

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{\textquoteright} rankings. Finally, we show that most of our bounds are tight.",

author = "Paula Jaramillo and Cagatay Kayi and Flip Klijn",

year = "2017",

language = "English (US)",

volume = "196",

series = "Barcelona GSE Working Papers Series ",

number = "956",

type = "WorkingPaper",

}

TY - UNPB

T1 - Rank Gaps and the Size of the Core for Roommate Problems

AU - Jaramillo, Paula

AU - Kayi, Cagatay

AU - Klijn, Flip

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

M3 - Working paper

VL - 196

T3 - Barcelona GSE Working Papers Series

BT - Rank Gaps and the Size of the Core for Roommate Problems

ER -