An algorithm to compute the full set of many-to-many stable matchings

Ruth Martı́Nez,Jordi Massó,Alejandro Neme,Jorge Oviedo

doi:10.1016/j.mathsocsci.2003.07.002

An algorithm to compute the full set of many-to-many stable matchings

Ruth Martı́Nez, Jordi Massó + Show 2 more

Open Access

https://doi.org/10.1016/j.mathsocsci.2003.07.002

Copy DOI

Journal: Mathematical Social Sciences	Publication Date: Sep 23, 2003
Citations: 55	License type: cc0

Affiliation: National University of San Luis, Consejo Nacional de Investigaciones Científicas y Técnicas, Autonomous University of Barcelona

#Stable Matchings #Optimal Stable Matchings + Show 5 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text