Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.09014 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910824526774272 |
|---|---|
| author | Liu, Hanbing Li, Ningyuan Li, Weian Qi, Qi Yu, Changyuan |
| author_facet | Liu, Hanbing Li, Ningyuan Li, Weian Qi, Qi Yu, Changyuan |
| contents | This paper explores the design of contests involving $n$ contestants, focusing on how the designer decides on the number of contestants allowed and the prize structure with a fixed budget. We characterize the unique symmetric Bayesian Nash equilibrium of contestants and find the optimal contests design for the maximum individual effort objective and the total effort objective. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09014 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Contest Design with Entry Restriction Liu, Hanbing Li, Ningyuan Li, Weian Qi, Qi Yu, Changyuan Computer Science and Game Theory This paper explores the design of contests involving $n$ contestants, focusing on how the designer decides on the number of contestants allowed and the prize structure with a fixed budget. We characterize the unique symmetric Bayesian Nash equilibrium of contestants and find the optimal contests design for the maximum individual effort objective and the total effort objective. |
| title | Optimal Contest Design with Entry Restriction |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2502.09014 |