Per citar aquest document: http://ddd.uab.cat/record/143679
An algorithm to compute the full set of many-to-many stable matchings
Martínez, Ruth (Universidad Nacional de San Luis (Argentina))
Massó, Jordi (Universitat Autònoma de Barcelona. Departament d’Economia i d’Història Econòmica)
Neme, Alejandro (Universidad Nacional de San Luis (Argentina))
Oviedo, Jorge (Universidad Nacional de San Luis (Argentina))

Data: 2004
Resum: 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.
Nota: We are grateful to a referee of this journal for helpful comments and suggestions. The work of R. Martínez, A. Neme, and J. Oviedo is partially supported by Research Grant 319502 from the Universidad Nacional de San Luis (Argentina). The work of J. Massó is partially supported by the Spanish Ministry of Science and Technology, through grant BEC2002-02130, and by the Departament d’Universitats, Recerca i Societat de la Informació (Generalitat de Catalunya), through grant 2001SGR-00162 and the Barcelona Economics Program (CREA). The paper was partially written while J. Massó was visiting the Universidad Carlos III de Madrid and A. Neme was visiting the Universitat Autònoma de Barcelona. They acknowledge the hospitality of their Departments of Economics and the financial support through two sabbatical fellowships from the Departament d’Universitats, Recerca i Societat de la Informació (Generalitat de Catalunya).
Nota: Número d'acord de subvenció 319502
Nota: Número d'acord de subvenció BEC2002-02130
Nota: Número d'acord de subvenció 2001SGR-00162
Drets: Tots els drets reservats
Llengua: Anglès
Document: article ; recerca ; submittedVersion
Matèria: Acoblament, Teoria de l' ; Matching ; Stability ; Substitutable preferences ; Algorithm
Publicat a: Mathematical social sciences, Vol. 47 Núm. 2 (March 2004) , p. 187-210, ISSN 0165-4896

DOI: 10.1016/j.mathsocsci.2003.07.002


Preprint
44 p, 312.1 KB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2015-11-23, darrera modificació el 2016-06-04



   Favorit i Compartir