Cycles to compute the full set of many-to-many stable matchings
arXiv:2110.11846 · doi:10.1016/j.mathsocsci.2022.03.001
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.