Cycles to Compute the Full Set of Many-to-many Stable Matchings

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

No 99, Working Papers from Red Nacional de Investigadores en Economía (RedNIE)

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.

Keywords: Stable matchings; cyclic matching; substitutable preferences (search for similar items in EconPapers)
JEL-codes: C78 D47 (search for similar items in EconPapers)
Pages: 27 pages
Date: 2021-12
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://rednie.eco.unc.edu.ar/files/DT/99.pdf (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 (2022)
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:aoz:wpaper:99

Access Statistics for this paper

More papers in Working Papers from Red Nacional de Investigadores en Economía (RedNIE) Contact information at EDIRC.
Bibliographic data for series maintained by Laura Inés D Amato ().