Optimal Contest Design with Entry Restriction
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.