English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/201887
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Constrained allocation of projects to heterogeneous workers with preferences over peers

AuthorsKlijn, Flip
KeywordsMatching
Allocation
Heterogeneous agents
Preferences over peers
Efficiency
(group) strategy-proofness
Issue DateJan-2019
PublisherWalter de Gruyter
CitationBE Journal of Theoretical Economics 19(1): 20170038 (2019)
AbstractWe study the problem of allocating projects to heterogeneous workers. The simultaneous execution of multiple projects imposes constraints across project teams. Each worker has preferences over the combinations of projects in which he can potentially participate and his team members in any of these projects. We propose a revelation mechanism that is Pareto-efficient and group strategy-proof (Theorem 1). We also identify two preference domains on which the mechanism is strongly group strategy-proof (Theorem 2). Our results subsume results by Monte and Tumennasan (2013) and Kamiyama (2013) .
Publisher version (URL)http://dx.doi.org/10.1515/bejte-2017-0038
URIhttp://hdl.handle.net/10261/201887
Identifiersdoi: 10.1515/bejte-2017-0038
e-issn: 1935-1704
Appears in Collections:(IAE) Artículos
Files in This Item:
File Description SizeFormat 
Constrained Allocation_Klijn.pdf658,67 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.