Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1958
Full metadata record
DC FieldValueLanguage
dc.creatorMartínez, Ruth-
dc.creatorMassó, Jordi-
dc.creatorNeme, Alejandro-
dc.creatorOviedo, Jorge-
dc.date2007-11-08T15:41:31Z-
dc.date2007-11-08T15:41:31Z-
dc.date2000-02-
dc.date.accessioned2017-01-31T00:58:15Z-
dc.date.available2017-01-31T00:58:15Z-
dc.identifierhttp://hdl.handle.net/10261/1958-
dc.identifier.urihttp://dspace.mediu.edu.my:8181/xmlui/handle/10261/1958-
dc.descriptionThe 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.-
dc.descriptionFinancial support through a grant from the Programa de Cooperación Científica Iberoamericana is acknowledged. The work of J. Massó is also partially supported by Research Grants PB98-0870 from the Dirección General de Investigación Científica y Técnica, Spanish Ministry of Education and Culture, and SGR98-62 from the Comissionat per Universitats i Recerca de la Generalitat de Catalunya.-
dc.descriptionPeer reviewed-
dc.languageeng-
dc.relationUFAE and IAE Working Papers-
dc.relation457.00-
dc.rightsopenAccess-
dc.titleAn Algorithm To Compute The Set Of Many-To-Many Stable Matchings-
dc.typeDocumento de trabajo-
Appears in Collections:Digital Csic

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.