We consider a variant of the Tullock rent-seeking contest. Under symmetric information we determine equilibrium strategies and prove their uniqueness. Then, we assume contestants to be privately informed about their costs of effort. We prove existence of a pure-strategy equilibrium and provide a...

We investigate a version of the classic Colonel Blotto game in which individual battles may have different values. Two players allocate a fixed budget across battlefields and each battlefield is won by the player who allocates the most to that battlefield. The winner of the game is the player...

We consider imperfectly discriminating, common-value, all-pay auctions (or contests) where some players know the value of the prize, others do not. We show that if the prize is always of positive value, then all players are active in equilibrium. If the prize is of value zero with positive...

This paper introduces a class of contest models in which each player decides when to stop a privately observed Brownian motion with drift and incurs costs depending on his stopping time. The player who stops his process at the highest value wins a prize. We prove existence and uniqueness of a...

We study a model of imperfectly discriminating contests with two ex ante symmetric agents. We consider four institutional settings: Contestants move either sequentially or simultaneously and in addition their types are either public or private information. We find that an effort-maximizing...

We consider a variant of the Tullock rent-seeking contest. Under symmetric information we determine equilibrium strategies and prove their uniqueness. Then, we assume contestants to be privately informed about their costs of effort. We prove existence of a pure-strategy equilibrium and provide a...

We study information disclosure and diversification in contests with technological uncertainty, where agents can pursue different technologies to compete in the contest, but there is uncertainty regarding which will be implemented ex post. The principal can credibly reveal some information about...

This paper explores the optimal design of biased contests. A designer imposes an identity-dependent treatment on contestants, which varies the balance of the playing field. A generalized lottery contest typically yields no closed-form equilibrium solutions, which nullifies the usual implicit...

This paper proposes a tractable model of a dynamic contest where players have private information about the contest's prize. We show that private information helps to encourage players who have fallen behind, leading to an increase in aggregate incentives. We derive the optimal information...