An Algorithm to Compute the set of Many-to-many Stable Matchings

MARTINEZ R. MASSÓ J. NEME A. AND OVIEDO J.

Mathematical Social Sciences

Elsevier

Año: 2004 vol. 47 p. 187 - 210

The paper proposes an algorithm to compute the full set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal stable matchings using the deferred-acceptance algorithm. Then, it computes each remaining stable matching as the firm-optimal stable matching corresponding to a new preference profile which is obtained after modifying the preferences of a previously identified sequence of firms.