A nearly optimal auction for an uninformed seller

This paper describes a nearly optimal auction mechanism that does not require previous knowledge of the distribution of values of potential buyers. The mechanism we propose builds on the new literature on the elicitation of information from experts. We extend the latter to the case where the secret information shared by the experts–potential buyers in our model–can be used against them if it becomes public knowledge.     

On efficiency of the English auction

We study efficiency properties of the irrevocable exit English auction in a setting with interdependent values. Maskin (1992) [1] shows that the pairwise single-crossing condition is sufficient for efficiency of the English auction with two bidders and suggests that it is also a necessary condition. This paper clarifies and extends Maskin?s results to the case of N bidders. We introduce the generalized single-crossing condition—a fairly intuitive extension of the pairwise single-crossing condition—and prove that it is essentially a necessary and sufficient condition for the existence of an efficient equilibrium of the N-bidder English auction.     

All equilibria of the Vickrey auction

This paper characterizes the set of Nash equilibria in the second-price sealed-bid auction with independent private values and three or more bidders. In addition, we show that any effective reserve price implies uniqueness.     

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.     

Outside options: Another reason to choose the first-price auction

In this paper we study equilibrium and experimental bidding behaviour in first-price and second-price auctions with outside options.We find that bidders do respond to outside options and to variations of common knowledge about competitors’ outside options. However, overbidding in first-price auctions is significantly higher with outside options than without. First-price auctions yield more revenue than second-price auctions. This revenue-premium is significantly higher with outside options. In second-price auctions the introduction of outside options has only a small effect.     

Information structures in optimal auctions

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal information structures in an optimal auction exhibit a number of properties: (i) information structures can be represented by monotone partitions, (ii) the cardinality of each partition is finite, (iii) the partitions are asymmetric across agents. We show that an optimal information structure exists.     

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.     

Correlated information, mechanism design and informational rents

Crémer and McLean (Econometrica 56 (1988) 1247-1258) obtain a sufficient and necessary condition for full surplus extraction in Bayesian-Nash equilibrium—the rank condition, which McAfee and Reny (Econometrica 60(2) (1992) 395-421) later generalize for continuous type spaces. This paper shows that, if the principal does not know how noisy is the agent's signal—or equivalently, when signals available to an agent can be ranked by Blackwell's informativeness and, an agent's informativeness is independent of others’ information, the rank condition fails to hold. Conversely, when rank condition fails and informational rents are left to an agent, the model can be interpreted as if, the principal were uncertain about the informativeness of the agent's signal.     

An experimental test of design alternatives for the British 3G/UMTS auction

In spring 2000, the British government auctioned off licences for Third Generation mobile telecommunications services. In the preparation of the auction, two designs involving each a hybrid of an English and a sealed-bid auction were considered by the government: A discriminatory and a uniform price variant. We report an experiment on these two designs, and also compare the results to those with a pure English auction. Both hybrids are similar in efficiency, revenue differences disappear as bidders get experienced. Compared to the discriminatory format, the pure English auction induces more entry.     

The Herodotus paradox

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 information, and in so doing identify what we call the “Herodotus paradox.”     

An experimental investigation of overdissipation in the all pay auction

Pervasive overbidding represents a well-documented feature of all-pay auctions. Aggregate bids exceed Nash predictions in laboratory experiments, and individuals often submit bids that guarantee negative profits. This paper examines three factors that may reduce pervasive overbidding: (a) repetition (experience), (b) reputation (strangers vs. partners), and (c) active participation. Reputation and repetition reduce aggregate overdissipation, but they eliminate it only in conjunction with active participation.     

The value of an informed bidder in common value auctions

I compare two information structures in a common value first-price auction with two bidders: In one, each of the two bidders knows only his own signal about the value of the object, and in the other, one of the bidders learns his opponent's signal as well. Gaining the additional information in the second information structure makes the informed bidder worse off if the value is submodular in the bidders' signals and better off if it is supermodular. If the value is supermodular, then the seller's revenue tends to be lower with the informed bidder than without.     

Equilibrium bids in practical multi-attribute auctions

This article proposes a nonlinear scoring rule which transforms multiple attributes of a bid into comparable dimensionless ones. Practically, the buyer can use it to select the most competitive winner. For risk-neutral bidders, we characterize a symmetric Bayes–Nash equilibrium and find that as the number of bidders increases the equilibrium quality improves, whereas the equilibrium price decreases.     

Bidding for the future: signaling in auctions with an aftermarket

This paper considers auctions where bidders compete for an advantage in future strategic interactions. When bidders wish to exaggerate their private information, equilibrium bidding functions are biased upwards as bidders attempt to signal via the winning bid. Signaling is most prominent in second-price auctions where equilibrium bids are “above value.” In English and first-price auctions, signaling is less extreme since the winner incurs the cost of her signaling choice. The opportunity to signal lowers bidders’ payoffs and raises revenue. When bidders understate their private information, separating equilibria need not exist and the auction may not be efficient.     

The effect of corruption on bidding behavior in first-price auctions

When the owner of an object sells it through an auction run by an agent of hers, corruption may appear. In a first-price auction, corruption can make honest bidders more or less aggressive, or their behavior can remain unchanged. We identify sufficient conditions for each of the three possibilities. We analyze the effects of corruption on efficiency, bidders’ welfare and expected revenue. Our results apply as well to the situation—unrelated to corruption—where one of the bidders is granted a right of first refusal.     

An elementary proof of the common maximal bid in asymmetric first-price and all-pay auctions

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.     

Winner's curse without overbidding

We report the results of a series of second-price auction experiments where each bidder's signal is given by a normally distributed value plus a normally distributed error. While bidders’ values differ in one treatment they are the same in another, which allows for a direct test of the “winner's curse” irrespective of confounding factors. Bidders may also fall prey to a “news curse” when they do not sufficiently take into account that signals and errors are correlated. We find that the effects of the winner's curse are mitigated by a news curse and loss or risk aversion.     

Optimal mechanism design with resale via bargaining

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully characterize an optimal mechanism under general conditions. Surprisingly, in this optimal mechanism, the seller never allocates the object to the regular buyer regardless of his bargaining power in the resale market. The seller sells only to the publicly known buyer, and reveals no additional information to the resale market. The possibility of resale causes the seller to sometimes hold back the object, which under our setup is never optimal if resale is prohibited. We find that the seller?s revenue is increasing in the publicly known buyer?s bargaining power in the resale market. When the publicly known buyer has full bargaining power, Myerson?s optimal revenue is achieved; when the publicly known buyer has no bargaining power, a conditionally efficient mechanism prevails.     

Incentive compatibility in non-quasilinear environments

We derive several implications of incentive compatibility in general (i.e., not necessarily quasilinear) environments. Building on Kos and Messner (2013), we provide a (partial) characterization of incentive compatible mechanisms.     

Strategic ignorance in a second-price auction

Suppose that bidders may publicly choose not to learn their values prior to a second-price auction with costly bidding. All equilibria with truthful bidding exhibit bidder ignorance when the number of bidders is sufficiently small. Ignorance considerations also affect the optimal reserve price.