Error message

Deprecated function: Array and string offset access syntax with curly braces is deprecated in include_once() (line 20 of /mnt/web104/a0/07/510451407/htdocs/includes/file.phar.inc).

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

Printer-friendly version
Article
Author/s: 
Paula Jaramillo, Çaǧatay Kayı, Flip Klijn
International Journal of Game Theory
Publisher: 
Springer
Year: 
2018
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.
Tags: 
Developed by Paolo Gittoi