Rank Gaps and the Size of the Core for Roommate Problems
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...
| Autores Principales: | , , |
|---|---|
| Otros Autores: | |
| Formato: | Documento de trabajo (Working Paper) |
| Lenguaje: | Español (Spanish) |
| Publicado: |
Universidad del Rosario
2017
|
| Materias: | |
| Acceso en línea: | http://repository.urosario.edu.co//handle/10336/13229 |