?An algorithm to compute the full set of mant-to-many stable matching?

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

Sao Paulo. Brazil.

Workshop; ? First Brazilian Workshop of the Game Theory Society.; 2002

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