The core of roommate problems: size and rank-fairness within matched pairs

Paula Jaramillo, ​Çağatay Kayı, Flip Klijn

Resultado de la investigación: Contribución a RevistaArtículo

Resumen

This paper deals with roommate problems (Gale and Shapley, Am Math Mon 69(1):9–15, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs 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.
Idioma originalEnglish (US)
Páginas (desde-hasta)157–179
Número de páginas23
PublicaciónInternational Journal of Game Theory
DOI
EstadoPublished - 2019

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty

Citar esto

@article{1bec012451ec4e40a98b139550fdf33b,
title = "The core of roommate problems: size and rank-fairness within matched pairs",
abstract = "This paper deals with roommate problems (Gale and Shapley, Am Math Mon 69(1):9–15, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs 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.",
author = "Paula Jaramillo and ​{\cC}ağatay Kayı and Flip Klijn",
year = "2019",
doi = "10.1007/s00182-018-0651-9",
language = "English (US)",
pages = "157–179",
journal = "International Journal of Game Theory",
issn = "0020-7276",
publisher = "Springer Berlin Heidelberg",

}

The core of roommate problems: size and rank-fairness within matched pairs. / Jaramillo, Paula; Kayı, ​Çağatay; Klijn, Flip.

En: International Journal of Game Theory, 2019, p. 157–179.

Resultado de la investigación: Contribución a RevistaArtículo

TY - JOUR

T1 - The core of roommate problems: size and rank-fairness within matched pairs

AU - Jaramillo, Paula

AU - Kayı, ​Çağatay

AU - Klijn, Flip

PY - 2019

Y1 - 2019

N2 - This paper deals with roommate problems (Gale and Shapley, Am Math Mon 69(1):9–15, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs 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, Am Math Mon 69(1):9–15, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs 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.

UR - http://www.scopus.com/inward/record.url?scp=85057620481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057620481&partnerID=8YFLogxK

U2 - 10.1007/s00182-018-0651-9

DO - 10.1007/s00182-018-0651-9

M3 - Article

AN - SCOPUS:85057620481

SP - 157

EP - 179

JO - International Journal of Game Theory

JF - International Journal of Game Theory

SN - 0020-7276

ER -