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

The third generation UMTS auction in Germany raised an enormous amount of revenue, and at the same time achieved a more competitive market structure than other UMTS auctions in Europe. The present paper explains the design of that auction, and presents a game theoretic explanation of observed...

The Babylonian bridal auction, described by Herodotus, is regarded as one of the earliest uses of an auction in history. Yet, to our knowledge, the literature lacks a formal equilibrium analysis of this auction. We provide such an analysis for the two-player case with complete and incomplete...

I present a two-player nested contest which is a convex combination of two widely studied contests: the Tullock (lottery) contest and the all-pay auction. A Nash equilibrium exists for all parameters of the nested contest. If and only if the contest is sufficiently asymmetric, then there is an...

A well-known theoretical result in the contest literature is that greater heterogeneity decreases performance of contestants because of the "discouragement effect." Leveling the playing field by favoring weaker contestants through bid-caps and favorable tie-breaking rules can reduce the...

In this paper, we generalize the General Lotto game and the Colonel Blotto game to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium...

The Colonel Blotto game is a two-player constant-sum game in which each player simultaneously distributes her fixed level of resources across a set of contests. In the traditional formulation of the Colonel Blotto game, the players’ resources are use it or lose itʺ in the sense that any...

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts "early"; and a group of players who choose "late". Only the...

This paper studies sabotage in a contest with non-identical players. Unlike previous papers, we consider sabotage in an elimination contest and allow contestants to sabotage a potential or future rival. It turns out that for a certain partition of players there is a pure-strategy equilibrium in...

We report results from the first experimental study of round-robin tournaments. In our experiment, we investigate how the prize structure affects the intensity, fair-ness, and dynamic behavior in sequential round-robin tournaments with three players. We compare tournaments with a second prize...