Computing the full set of many-to-many stable matchings: an algorithm using cycles.

JUAREZ, NOELIA; BONIFACIO, AGUSTÍN; OVIEDO, JORGE; NEME, PABLO

VIRTUAL

Congreso; Virtuma; 2021

Universidad Nacional de Cuyo

In a many-to-many matching model in which agents? preferences satisfy substitutabilityand the law of aggregate demand, we present an algorithm to computethe full set of stable matchings. This algorithm relies on the idea of ?cycles in preferences?and generalizes the celebrated algorithm of Irving and Leather (1986).