Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1846
Full metadata record
DC FieldValueLanguage
dc.creatorMartínez, Ruth-
dc.creatorMassó, Jordi-
dc.creatorNeme, Alejandro-
dc.creatorOviedo, Jorge-
dc.date2007-11-05T14:42:12Z-
dc.date2007-11-05T14:42:12Z-
dc.date2003-05-16-
dc.date.accessioned2017-01-31T00:58:01Z-
dc.date.available2017-01-31T00:58:01Z-
dc.identifierhttp://hdl.handle.net/10261/1846-
dc.identifier.urihttp://dspace.mediu.edu.my:8181/xmlui/handle/10261/1846-
dc.descriptionFor the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.-
dc.descriptionThe 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 Research Grants BEC2002-2130 from the Dirección General de Investigación Científica y Técnica (Spanish Ministry of Science and Technology) and 2001SGR-00162 from the Departament d’Universitats, Recerca i Societat de la Informació (Generalitat de Catalunya).-
dc.languageeng-
dc.relationUFAE and IAE Working Papers-
dc.relation577.03-
dc.rightsopenAccess-
dc.subjectMatching-
dc.subjectStability-
dc.subjectStrategy-proofness-
dc.titleOn group strategy-proof mechanisms for a many-to-one matching model-
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.