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

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

Full description

Autores:
Tipo de recurso:
Fecha de publicación:
2019
Institución:
Universidad del Rosario
Repositorio:
Repositorio EdocUR - U. Rosario
Idioma:
eng
OAI Identifier:
oai:repository.urosario.edu.co:10336/24358
Acceso en línea:
https://doi.org/10.1007/s00182-018-0651-9
https://repository.urosario.edu.co/handle/10336/24358
Palabra clave:
Bound
Core
Matching
Rank gap
Rank-fairness
Roommate problem
Stability
Rights
License
Abierto (Texto Completo)