2024-03-28T08:45:35Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/19582016-02-16T02:09:32Zcom_10261_58com_10261_7col_10261_689
00925njm 22002777a 4500
dc
MartÃnez, Ruth
author
Massó, Jordi
author
Neme, Alejandro
author
Oviedo, Jorge
author
2000-02
The paper proposes an algorithm to compute the 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.
http://hdl.handle.net/10261/1958
An Algorithm To Compute The Set Of Many-To-Many Stable Matchings