Rank Gaps and the Size of the Core for Roommate Problems

Jaramillo, Paula; Kayi, Cagatay; Klijn, Flip

doi:https://doi.org/10.48713/10336_13229

Ítem

Acceso Abierto

Rank Gaps and the Size of the Core for Roommate Problems

http://repository.urosario.edu.co//handle/10336/13229
https://doi.org/10.48713/10336_13229

Autores

Jaramillo, Paula

Kayi, Cagatay

Klijn, Flip

Archivos

HTML

PDF

Fecha

2017-02

Editor

Universidad del Rosario

Buscar en:

Métricas alternativas

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.