The paper studies when efficient allocations are implementable via coalition-proof mechanisms. When ambiguous mechanisms are allowed and agents are maxmin expected utility maximizers, we prove that all efficient allocations are implementable via interim coalition incentive compatible mechanisms...

I investigate the decision problem of a player in a game of incomplete information who faces uncertainty about the other players' strategies. I propose a new decision criterion which works in two steps. First, I assume common knowledge of rationality and eliminate all strategies which are not...

This paper provides a fully fledged equilibrium analysis for two-player sequential-move contests with complete information, while allowing for a full spectrum of the contest's accuracy and players' asymmetry. For a strong-lead contest, an interior equilibrium (both players are active) prevails...

Morgan (Public Choice, 116:1-18, 2003) finds that the aggregate effort is greater in sequential than in simultaneous lottery contests. We show that Morgan's result is incorrect due to a slip in a proof, and that the aggregate effort is greater in sequential contests only if contestants are...

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

I study sequential contests where the efforts of earlier players may be disclosed to later players by nature or by design. The model has a range of applications, including rent seeking, R&D, oligopoly, public goods provision, and tragedy of the commons. I show that information about other...

We conduct a laboratory experiment to compare the fairness and intensity of round-robin tournaments with three symmetric players, a single prize, and two alternative match formats. Matches are either organized as lottery contests or all-pay auctions. Whereas we confirm the theoretical prediction...

We consider multi-stage elimination contests, where agents efforts at different stages generate some output for the organizers. Depending on the output function we characterize the optimal prize structure of the tournament and show that it is almost efficient. We have found that in some cases...

We consider contestants who must choose exactly one contest, out of several, to participate in. We show that when the contest technology is of a certain type, or when the number of contestants is large, a self-allocation equilibrium, i.e., one where no contestant would wish to change his choice...

We examine the fairness and intensity of sequential round-robin tournaments with multiple prizes. With three symmetric players and two prizes, the tournament is completely fair if and only if the second prize is valued half of the first prize, regardless of whether matches are organized as...