visitant ::
identificació
|
|||||||||||||||
Cerca | Lliura | Ajuda | Servei de Biblioteques | Sobre el DDD | Català English Español |
Pàgina inicial > Articles > Articles publicats > On the lattice structure of the set of stable matchings for a many-to-one model |
Data: | 2001 |
Resum: | For the many-to-one matching model with firms having substitutable and q-separable preferences we propose two very natural binary operations that together with the unanimous partial ordering of the workers endow the set of stable matchings with a lattice structure. We also exhibit examples in which, under this restricted domain of firms' preferences, the classical binary operations may not even be matching. |
Ajuts: | Ministerio de Educación y Ciencia PB98-0870 Agència de Gestió d'Ajuts Universitaris i de Recerca 1998/SGR-62 |
Nota: | We thank José Alcade, Howard Petith, Alvin Roth, and a referee for their helpful comments. Financial support through a grant from the Programa de Cooperación Científica Iberoamericana is acknowledged. The work of Jordi 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. The paper was partially written while Alejandro Neme was visiting the UAB under a sabbatical fellowship from the Spanish Ministry of Education and Culture |
Drets: | Tots els drets reservats. |
Llengua: | Anglès |
Document: | Article ; recerca ; Versió sotmesa a revisió |
Matèria: | Acoblament, Teoria de l' ; Many-to-one Matchings ; Stability ; Lattice |
Publicat a: | Optimization, Vol. 50 Núm. 5-6 (January 2001) , p. 439-457, ISSN 1029-4945 |
Preprint 20 p, 232.8 KB |