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...

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...

We study mediated many-to-many matching in markets in which valuations evolve over time as the result of shocks, learning through experimentation, or a preference for variety. The analysis uncovers the key tradeoffs that platforms face in the design of their matching protocols. It shows that the...

In this paper we consider equilibrium behavior in a Dutch (descending price) auction where the bidders are uninformed of their valuations with probability 1-q and can acquire information about their valuation at a positive cost during the auction. We assume that the information acquisition...

In this paper we consider equilibrium behavior in a Dutch (descending price) auction where the bidders are uninformed of their valuations with probability q and can acquire information about their valuation at a positive cost during the auction. We assume that the information acquisition...

We study the design of sequential procurement strategies that integrate stochastic and strategic information. We consider a buyer who repeatedly demands a certain good and is unable to commit to long-term contracts. In each time period, the buyer makes a price offer to a seller who has private,...

A standard incomplete-information war of attrition is extended to incorporate experimentation and private learning. We obtain a characterization of all equilibria in this extended setup and use this setup to illuminate a tradeoff between short-run and long-run gains of experimentation. The...

Perfectly discriminating contests (or all pay auction) are widely used as a model of situations where individuals devote resources to win some prize. In reality such contests are often preceded by investments of the contestants into their ability to fight in the contest. This paper studies a two...

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...

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...