We study optimal information disclosure in static contests where players do not know their own values of winning but can learn them, publicly or privately, from the designer. The designer chooses a disclosure policy that maximizes the total expected effort, and commits to it before observing the...

We develop a model where two players with asymmetric preferences engage in a contest game. The key novelty is the introduction of multi-dimensional rewards. We characterize the optimal prize allocation that maximizes aggregate effort. When heterogeneity in preferences is strong and the designer...

We develop a model where two players with asymmetric preferences engage in a contest game. The key novelty is the introduction of multi-dimensional rewards. We characterize the optimal prize allocation that maximizes aggregate effort. When heterogeneity in preferences is strong and the designer...

We study optimal information disclosure in static contests where players do not know their own values of winning but can learn them, publicly or privately, from the designer. The designer chooses a disclosure policy that maximizes the total expected effort and commits to it before observing the...