English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/1846
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

On group strategy-proof mechanisms for a many-to-one matching model

AuthorsMartínez, Ruth; Massó, Jordi; Neme, Alejandro; Oviedo, Jorge
KeywordsMatching
Stability
Strategy-proofness
Issue Date16-May-2003
SeriesUFAE and IAE Working Papers
577.03
AbstractFor 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.
URIhttp://hdl.handle.net/10261/1846
Appears in Collections:(IAE) Informes y documentos de trabajo
Files in This Item:
File Description SizeFormat 
57703.pdf397,48 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.