Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baranski, Andrzej | - |
dc.contributor.author | Goel, Sumit | - |
dc.date.accessioned | 2024-11-12T05:43:25Z | - |
dc.date.available | 2024-11-12T05:43:25Z | - |
dc.date.issued | 2024-10 | - |
dc.identifier.citation | Baranski, 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.uri | http://hdl.handle.net/2451/74658 | - |
dc.description.abstract | We 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.iso | en | en |
dc.relation.ispartofseries | NYUAD Division of Social Science Working Papers;#0104 | - |
dc.title | Contest design with a finite type-space: A unifying approach | en |
dc.type | Working Paper | en |
Appears in Collections: | Social Science Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP_0104.pdf | 495 kB | Adobe PDF | View/Open |
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.