Cycles to compute the full set of many-to-many stable matchings
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913326403944448 |
|---|---|
| author | Bonifacio, Agustin G. Juarez, Noelia Neme, Pablo Oviedo, Jorge |
| author_facet | Bonifacio, Agustin G. Juarez, Noelia Neme, Pablo Oviedo, Jorge |
| contents | In a many-to-many matching model in which agents' preferences satisfy substitutability and the law of aggregate demand, we present an algorithm to compute the full set of stable matchings. This algorithm relies on the idea of "cycles in preferences" and generalizes the algorithm presented in Roth and Sotomayor (1990) for the one-to-one model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2110_11846 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Cycles to compute the full set of many-to-many stable matchings Bonifacio, Agustin G. Juarez, Noelia Neme, Pablo Oviedo, Jorge Theoretical Economics In a many-to-many matching model in which agents' preferences satisfy substitutability and the law of aggregate demand, we present an algorithm to compute the full set of stable matchings. This algorithm relies on the idea of "cycles in preferences" and generalizes the algorithm presented in Roth and Sotomayor (1990) for the one-to-one model. |
| title | Cycles to compute the full set of many-to-many stable matchings |
| topic | Theoretical Economics |
| url | https://arxiv.org/abs/2110.11846 |