Ítem
Acceso Abierto
Rank Gaps and the Size of the Core for Roommate Problems
Título de la revista
Autores
Jaramillo, Paula
Kayi, Cagatay
Klijn, Flip
Fecha
2017-02
Directores
ISSN de la revista
Título del volumen
Editor
Universidad del Rosario
Citations
Métricas alternativas
Resumen
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.
Palabras clave
Keywords
Matching , Roommate problem , Stability , Core , Rank gap , Bound
Citations
