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 studies complete-information, all-pay contests with asymmetric players competing for heterogeneous prizes. In these contests, each player chooses a performance level or "score". The first prize is awarded to the player with the highest score, the second -- less valuable -- prize to...

I study optimal disclosure policies in sequential contests. A contest designer chooses at which periods to publicly disclose the efforts of previous contestants. I provide results for a wide range of possible objectives for the contest designer. While different objectives involve different...

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 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 analyze a divisible good uniform-price auction that features two groups each with a finite number of identical bidders. Equilibrium is unique, and the relative market power of a group increases with the precision of its private information but declines with its transaction costs. In line with...

We analyze a divisible good uniform-price auction that features two groups each with a finite number of identical bidders and present conditions under which a unique privately revealing equilibrium exists. We derive novel comparative static results highlighting that increases in transaction...

We analyze a divisible good uniform‐price auction that features two groups, each with a finite number of identical bidders, who compete in demand schedules. In the linear‐quadratic‐normal framework, this paper presents conditions under which the unique equilibrium in linear demands exists...

We analyze a divisible good uniform-price auction that features two groups each with a finite number of identical bidders. Equilibrium is unique, and the relative market power of a group increases with the precision of its private information but declines with its transaction costs. In line with...

This paper explores how a seller should transmit product information to bidders with horizontally differentiated preferences. Under cheap-talk, we show that, in an informative equilibrium, the seller provides less precise information for more popular product attributes. Second, for any given...