Cycles to compute the full set of many-to-many stable matchings

Agustín Bonifacio, Noelia Juarez, Pablo Neme and Jorge Oviedo

Papers from arXiv.org

Abstract: 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.

Date: 2021-10, Revised 2022-03
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://arxiv.org/pdf/2110.11846 Latest version (application/pdf)

Related works:
Journal Article: Cycles to compute the full set of many-to-many stable matchings (2022)
Working Paper: Cycles to Compute the Full Set of Many-to-many Stable Matchings (2021)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2110.11846

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().