This paper provides a general study of a contest modeled as a multiplayer incomplete-information, all-pay auction with sequential entry. The contest consists of multiple periods. Players arrive and exert efforts sequentially to compete for a prize. They observe the efforts made by their earlier...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

The second-generation GSM spectrum auction in Germany is probably the most clear cut example of a low price outcome in a simultaneous ascending-bid auction.The present paper gives an account of the events, describes the auction rules and market conditions, and provides a theoretical explanation...

In procurement auctions, bidders are usually better informed about technical, financial, or legal aspects of the goods and services procured. Therefore, the buyer may include a dialogue in the procurement procedure which enables the suppliers to reveal information that will help the buyer to...

This paper analyzes intertemporal effort provision in two-stage tournaments. A principal with a fixed budget for prizes faces two risk-neutral agents. He observes noisy signals of effort in both periods. His goal is to maximize either total efforts (perfect substitutes) or the product of first-...

This paper studies the optimal design of dynamic research contests. We introduce interim transfers, which are paid in every period while the contest is ongoing, to an otherwise standard setting. We show that a contest where: (i) the principal can stop the contest in any period, (ii) a constant...

We consider the design of contests for n agents when the principal can choose both the prize profile and the contest success function. Our framework includes Tullock contests, Lazear-Rosen tournaments and all-pay contests as special cases, among others. We show that the optimal contest has an...