Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBaranski, Andrzej-
dc.contributor.authorGoel, Sumit-
dc.date.accessioned2024-11-12T05:43:25Z-
dc.date.available2024-11-12T05:43:25Z-
dc.date.issued2024-10-
dc.identifier.citationBaranski, A., & Goel, S. (2024). Contest design with a finite type-space: A unifying approach. NYUAD Division of Social Science Working Paper, #0104.en
dc.identifier.urihttp://hdl.handle.net/2451/74658-
dc.description.abstractWe study the classical contest design problem of allocating a budget across prizes to maximize effort. While the previous literature has predominantly focused on continuum type-space or complete information domains, we analyse the finite type-space domain, thus providing a unifying approach that sheds light on the contrasting structure of optimal contests in these extreme environments. Our results include a characterization of the equilibrium, which involves agents mixing over contiguous intervals and converges to the appropriate continuum type-space equilibrium, and an investigation of how increasing competition influences effort, leading to optimality of winner-takes-all contest under linear and concave costs.en
dc.language.isoenen
dc.relation.ispartofseriesNYUAD Division of Social Science Working Papers;#0104-
dc.titleContest design with a finite type-space: A unifying approachen
dc.typeWorking Paperen
Appears in Collections:Social Science Working Papers

Files in This Item:
File Description SizeFormat 
WP_0104.pdf495 kBAdobe PDFView/Open


Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.