I examine sequential round-robin tournaments with three and four symmetric players. Each player is matched once with each other player. If the matches are organized as Tullock contests (all-pay auctions), the tournament will be almost fair (highly discriminatory): subject to the position of...

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 study experimentally the effect of bargaining power in two sequential mechanisms that offer the possibility to trade at a fixed price before an auction. In the “Buy-It-Now” format, the seller has the bargaining power and offers a price prior to the auction; whereas in the...

This paper explores the sale of an object to an ambiguity averse buyer. We show that the seller can increase his profit by using an ambiguous mechanism. That is, the seller can benefit from hiding certain features of the mechanism that he has committed to from the agent. We then characterize the...

We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative)...

This article investigates the impact of the distribution of preferences on equilibrium behavior in conflicts that are modeled as all-pay auctions with identity-dependent externalities. In this context, we define centrists and radicals using a willingness-to-pay criterion that admits preferences...

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

Recent literature has shown that all-pay auctions raise more money for charity than winner-pay auctions. We demonstrate that the first and second-price winner-pay auctions generate higher revenue than first-price all-pay auctions when bidders are sufficiently asymmetric. To prove it, we consider...

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

Cost overrun is ubiquitous in public procurement. We argue that this can be the result of a constraint optimal award procedure when the procurer cannot commit not to renegotiate. If cost differences are more pronounced for more complex designs, it is optimal to fix a simple design ex ante and to...