On optimal head starts in all-pay auctions

We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer’s objective is to maximize a convex combination of the expected highest effort and the expected aggregate effort. Unless the weight on the highest effort is one, small head starts are always worse than no head start. Moreover, the optimal head start is strictly positive if and only if the weight on the highest effort is large enough.     

Expected revenue of all-pay and first-price sealed-bid auctions with affiliated signals

In the general symmetric auction framework of Milgrom and Weber (1982) it is shown—as a new manifestation of thelinkage principle—that the all-pay sealed-bid auction yieldshigher expected revenue than the standard first-price sealed-bid auction. This raises the question why sealed-bid auctions of the standard first-price variety are observed in practice whereas the all-pay variety is not.     

Information acquisition in conflicts

This paper considers incentives for information acquisition ahead of conflicts. First, we characterize the (unique) equilibrium of the all-pay auction between two players with one-sided asymmetric information where one player has private information about his valuation. Then, we use our results to study information acquisition prior to an all-pay auction. If the decision to acquire information is observable, but not the information received, one-sided asymmetric information can occur endogenously in equilibrium. Moreover, the cut-off values of the cost of information that determine equilibrium information acquisition are higher than those in the first best. Thus, information acquisition is excessive. In contrast, with open or covert information acquisition, the equilibrium cut-off values are as in the first best.     

Lottery versus all-pay auction contests: A revenue dominance theorem

We allow a contest organizer to bias a contest in a discriminatory way; i.e., she can favor specific contestants by designing the contest rule in order to maximize total equilibrium effort (resp. revenue). The two predominant contest regimes are considered, all-pay auctions and lottery contests. For all-pay auctions the optimal bias is derived in closed form: It implies extreme competitive pressure among active contestants and low endogenous participation rates. Moreover, the exclusion principle advanced by Baye et al. (1993) becomes obsolete in this case. In contrast, the optimally biased lottery induces a higher number of actively participating contestants due to softer competition. Our main result regarding total revenue comparison under the optimal biases reveals that the all-pay auction revenue-dominates the lottery contest for all levels of heterogeneity among contestants. The incentive effect due to a strongly discriminating contest rule (all-pay auction) dominates the participation effect due to a weakly discriminating contest rule (lottery).     

On the continuous equilibria of affiliated-value,all-pay auctions with private budget constraints

We consider all-pay auctions in the presence of interdependent, affiliated valuations and private budget constraints. For the sealed-bid, all-pay auction we characterize a symmetric equilibrium in continuous strategies for the case of N bidders. Budget constraints encourage more aggressive bidding among participants with large endowments and intermediate valuations. We extend our results to the war of attrition where we show that budget constraints lead to a uniform amplification of equilibrium bids among bidders with sufficient endowments. An example shows that with both interdependent valuations and private budget constraints, a revenue ranking between the two auction formats is generally not possible. Equilibria with discontinuous bidding strategies are discussed.     

Banning Bidders from All-pay Auctions

We consider an all-pay auction with complete information among the bidders; the seller does not observe the bidders’ values. We show that for some information structures in which the seller has a small uncertainty about the valuations, it is profitable for him to exclude from the auction all but two (randomly selected) bidders even though the latter are ex ante identical from his point of view.I am grateful to Paolo Bertoletti who introduced me to this topic and provided useful comments. I also thank Dan Kovenock (Co-Editor) and two anonymous referees for suggestions which considerably improved the exposition.     

Reserve price signaling

In a general auction model in which bidders’ signals are affiliated, we characterize the unique separating equilibrium in which the seller can use reserve prices to credibly signal her private information. When the buyers’ signals are independent, the optimal reserve price is shown to be increasing in the number of bidders under certain conditions. We also demonstrate that the probability that the item is sold at the reserve price can increase as the number of bidders increases, which indicates a more central role for reserve prices than perceived in the standard auction models.     

Sequential two-prize contests

We study a two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize. Each player may win either one or two prizes. We analyze the unique subgame-perfect equilibrium of our model with two players where each player??s marginal values for the prizes are decreasing, constant, or increasing. We also analyze an equilibrium of the model with more than two players where each player??s marginal values for the prizes are nonincreasing.     

The all-pay auction with complete information

Summary In a (first price) all-pay auction, bidders simultaneously submit bids for an item. All players forfeit their bids, and the high bidder receives the item. This auction is widely used in economics to model rent seeking, R&D races, political contests, and job promotion tournaments. We fully characterize equilibrium for this class of games, and show that the set of equilibria is much larger than has been recognized in the literature. When there are more than two players, for instance, we show that even when the auction is symmetric there exists a continuum of asymmetric equilibria. Moreover, for economically important configurations of valuations, there is no revenue equivalence across the equilibria; asymmetric equilibria imply higher expected revenues than the symmetric equilibrium.We are grateful to Jacques Crémer, Chuangyin Dang, Jürgen Dennert, Chaim Fershtman, Martin Hellwig, Arthur Robson, Heinrich Ursprung, Eric van Damme, Ton Vorst, and the referees for helpful comments. We benefitted from presentations at the World Congress of the Econometric Society in Barcelona, the European Meeting on the Economics of Information at Tilburg University, the Midwest Mathematical Economics Meetings at the University of Illinois, and seminars at Texas A&M University, The Pennsylvania State University, Tilburg University and the University of Montreal. Baye is grateful for support from the CentER for Economic Research at Tilburg University and the Tinbergen Institute where earlier versions of this paper were completed. Kovenock acknowledges support from Erasmus Universiteit Rotterdam, the Tinbergen Institute, the Center for Economic Studies at the University of Munich, the Institut d'Analisi Economica CSIC at the Universitat Autonoma de Barcelona, the Krannert School of Management, and the Jay N. Ross Young Faculty Scholar Award.     

Unfair contests

Real-world contests are often “unfair” in the sense that outperforming all rivals may not be enough to be the winner, because some contestants are favored by the allocation rule, while others are handicapped. This paper analyzes an unfair, two-player discriminatory contest (all-pay auction) with private values. We characterize equilibrium strategies, provide closed form solutions, and illustrate additional strategic issues arising in such unfair contests.     

Difference-Form Contests and the Robustness of All-Pay Auctions

In much of the existing literature on rent-seeking games, the outcome of the contest is either infinitely sensitive or relatively insensitive to contestants' efforts. The current paper presents a family of contest games that permit characterization of equilibrium for all levels of sensitivity of the outcome to contestants' efforts. Specifically, the outcome of the contest depends on the difference between efforts, which encompass the lottery and the all-pay auction as polar cases. The equilibrium converges to that of the all-pay auction as the probability of winning the prize grows infinitely sensitive to one's effort, and the main qualitative features of equilibrium persist over a large parameter region. Journal of Economic Literature Classification Numbers: D44, D72.     

Beyond chopsticks: Symmetric equilibria in majority auction games

Majority auction games are simultaneous sealed-bid auctions of identical objects among identical bidders who each want to win a specified fraction (more than a half) of the objects. Each bidder receives no benefit from winning less than the specified fraction and no additional benefit from winning more than it. Symmetric equilibria having simple, intuitive forms are shown to exist in first-price, second-price and all-pay versions of such games when the number of bidders is sufficiently large. This contrasts with earlier results for the two-bidder “pure chopstick” majority auction games where the only known equilibria are more complicated.     

First-price sealed-bid auctions when bidders exhibit different attitudes toward risk

When bidders have different risk aversion levels, we determine in a first-price auction, the asymmetric equilibrium strategies. We analyze the impact of asymmetric risk aversion levels on bidders’ markups and on the expected revenue and allocative efficiency of the auction.     

Auctions with uncertain numbers of bidders

We investigate bidders’ and seller's responses to ambiguity about the number of bidders in the first price auction (FPA) and the second price auction (SPA) with independent private valuations. We model ambiguity aversion using the maxmin expected utility model. We find that bidders prefer the number of bidders to be revealed in the FPA, are indifferent between revealing and concealing in the SPA, and prefer the SPA to the FPA. If bidders are more pessimistic than the seller then the seller prefers to conceal the number of bidders in the FPA, and prefers the FPA to the SPA.     

Efficient collusion in repeated auctions with communication

This paper studies collusion in repeated auctions when bidders communicate prior to each stage auction. For independent and correlated private signals and general interdependent values, the paper identifies conditions under which an equilibrium collusion scheme is fully efficient in the sense that the bidders’ payoff is close to what they get when the object is allocated to the highest valuation bidder at the reserve price in every period.     

Dynamic legislative decision making when interest groups control the agenda

We consider dynamic decision making in a legislature, in which in each period legislators vote between the status quo (previous period?s policy) and a new bill. However, the agenda formation process is captured by interest groups, that is, the new bill on the agenda is determined by an all-pay auction among these groups. We show that convergence to the median voter of the legislature arises if interest groups are patient enough but not necessarily otherwise. We characterize the bound on the speed of convergence in a family of stationary equilibria in which policy bounces between right-wing and left-wing policies. We also show that convergence may be faster if organized interest groups represent only one side of the policy space, e.g., when only business and not consumer interests are organized.     

Surplus extraction with rich type spaces

We characterize revenue maximizing mechanisms in auction settings with ‘rich’ type spaces, where bidders obtain information from sources other than their own valuation. By considering a relaxed problem, we provide an upper bound on revenue extraction that explicitly builds on the richness of the information structure. We provide a condition under which this upper bound is achieved and describe an optimal mechanism. Under this condition, we also show that the optimal revenue can be achieved through dominant strategy implementation.     

Sealed bid auctions with ambiguity: Theory and experiments

This study presents a laboratory experiment of the first and second price sealed bid auctions with independent private values, where the distribution of bidder valuations may be unknown. In our experimental setting, in first price auctions, bids are lower with the presence of ambiguity. This result is consistent with ambiguity loving in a model that allows for different ambiguity attitudes. We also find that the first price auction generates significantly higher revenue than the second price auction with and without ambiguity.     

Multidimensional private value auctions

We consider parametric examples of symmetric two-bidder private value auctions in which each bidder observes her own private valuation as well as noisy signals about her opponent's private valuation. We show that, in such environments, the revenue equivalence between the first and second price auctions (SPAs) breaks down and there is no definite revenue ranking; while the SPA is always efficient allocatively, the first price auction (FPA) may be inefficient; equilibria may fail to exist for the FPA. We also show that auction mechanisms provide different incentives for bidders to acquire costly information about opponents’ valuation.     

The symmetric multiple prize all-pay auction with complete information

This paper extends the analysis of the n-player all-pay auction with complete information to cover the case of m≤n prizes, valued in weakly decreasing order, but symmetrically across players. We provide a complete characterization of the Nash equilibrium distributions for this class of auctions and provide an exact expression for the expected revenue generated.