A many-to-many 'rural hospital theorem'
© 2014 Elsevier B.V. We show that the full version of the so-called 'rural hospital theorem' generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We reinforce our result by showing that when agents'...
| Authors: | , |
|---|---|
| Format: | article |
| Status: | Versión aceptada para publicación |
| Publication Date: | 2014 |
| Country: | España |
| Institution: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repository: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/125577 |
| Online Access: | http://hdl.handle.net/10261/125577 |
| Access Level: | Open access |
| Keyword: | Many-to-many Matching Rural hospital theorem Stability |
| Summary: | © 2014 Elsevier B.V. We show that the full version of the so-called 'rural hospital theorem' generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We reinforce our result by showing that when agents' preferences satisfy substitutability, the domain of weakly separable preferences is also maximal for the rural hospital theorem to hold. |
|---|