All equilibria of the multi-unit Vickrey auction

This paper completely characterizes the set of equilibria of the Vickrey auction for multiple identical units when buyers have non-increasing marginal valuations and there are at least three potential buyers. There are two types of equilibria: In the first class of equilibria there are positive bids below the maximum valuation. In this class, above a threshold value all bidders bid truthfully on all units. One of the bidders bids at the threshold for any unit for which his valuation is below the threshold; the other bidders bid zero in this range. In the second class of equilibria there are as many bids at or above the maximum valuation as there are units. The allocation of these bids is arbitrary across bidders. All the remaining bids equal zero. With any positive reserve price equilibrium becomes unique: Bidders bid truthfully on all units for which their valuation exceeds the reserve price.     

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.     

The role of optimal threats in auction design

This paper studies revenue-maximizing auctions when buyers' outside options depend on their private information and are endogenously chosen by the seller. We show that the revenue-maximizing assignment of the object can depend crucially on the outside options that the seller can choose as threats. Depending on the shape of outside options, sometimes an optimal mechanism allocates the object in an ex-post efficient way, and, other times, buyers obtain the object more often than is efficient.     

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.     

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.     

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.     

Trading with a common agent under complete information: A characterization of Nash equilibria

We analyze an abstract model of trading where N principals submit quantity-payment schedules that describe the contracts they offer to an agent, and the agent then chooses how much to trade with every principal. This represents a special class of common agency games with complete information. We study all the subgame perfect Nash equilibria of these games, not only truthful ones, providing a complete characterization of equilibrium payoffs. In particular, we show that the equilibrium that is Pareto-dominant for the principals is not truthful when there are more than two of them. We also provide a partial characterization of equilibrium strategies.     

On ascending Vickrey auctions for heterogeneous objects

We construct an ascending auction for heterogeneous objects by applying a primal-dual algorithm to a linear program that represents the efficient-allocation problem for this setting. The auction assigns personalized prices to bundles, and asks bidders to report their preferred bundles in each round. A bidder's prices are increased when he belongs to a “minimally undersupplied” set of bidders. This concept generalizes the notion of “overdemanded” sets of objects introduced by Demange, Gale, and Sotomayor for the one-to-one assignment problem. Under a submodularity condition, the auction implements the Vickrey-Clarke-Groves outcome; we show that this type of condition is somewhat necessary to do so. When classifying the ascending-auction literature in terms of their underlying algorithms, our auction fills a gap in that literature. We relate our results to various ascending auctions in the literature.     

Supply function equilibria: Step functions and continuous representations

In most electricity markets generators must submit step-function offers to a uniform price auction. These markets are often modelled as simpler pure-strategy Supply Function Equilibria (SFE) with continuous supply functions. Critics argue that the discreteness and discontinuity of the required steps drastically change Nash equilibria, invalidating predictions of the SFE model. We prove that there are sufficient conditions, offered quantities can be continuously varied, offered prices are selected from a finite set, and the density of the additive demand shock is not too steep, where the resulting stepped SFE converges to the continuous SFE as the number of steps increases, reconciling the apparently very disparate approaches to modelling electricity markets.     

Ascending price Vickrey auctions for general valuations

Ascending price auctions involving a single price path and buyers paying their final bid price cannot achieve the Vickrey-Clarke-Groves (VCG) outcome in the combinatorial auctions setting. Using a notion called universal competitive equilibrium prices, shown to be necessary and sufficient to achieve the VCG outcome using ascending price auctions, we define a class of ascending price auctions in which buyers bid on a single price path. Truthful bidding by buyers is an ex post Nash equilibrium in such auctions. By giving discounts to buyers from the final price, the VCG outcome is achieved for general valuations.     

Multiple equilibria in Tullock contests

We find the sufficient conditions for the existence of multiple equilibria in Tullock-type contests, and show that asymmetric equilibria arise even under symmetric prize and cost structures. We then present existing contests where multiple equilibria exist under reasonably weak conditions.     

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.     

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.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Non-Walrasian equilibria and the law of one price

We present a market game which features multiple posts for each commodity. We use this framework to illustrate the idea that in non-Walrasian markets, where individual activities influence market clearing prices, there are equilibria where commodities are exchanged simultaneously in two posts at different prices, thus defying the ‘law of one price’. Such equilibria are compatible with an apparent arbitrage possibility, which dissipates whenever individuals try to take advantage of it.     

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.     

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions. These sufficient conditions unify and generalize existing sufficient conditions. Our generalization of potential games is useful in other game theoretic problems where potential methods have been applied.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Bargaining and inequity aversion: On the efficiency of the double auction

In a bargaining setting with asymmetrically informed, inequity-averse parties, a fully efficient mechanism (i.e., the double auction) exists if and only if compassion is strong. Less compassionate parties do not trade in the double auction in the limit of strong envy.     

Iterated potential and robustness of equilibria

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies such a procedure to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an iterated MP-maximizer is robust to incomplete information [A. Kajii, S. Morris, The robustness of equilibria to incomplete information, Econometrica 65 (1997) 1283-1309] and absorbing and globally accessible under perfect foresight dynamics for a small friction [A. Matsui, K. Matsuyama, An approach to equilibrium selection, J. Econ. Theory 65 (1995) 415-434]. Several simple sufficient conditions under which a game has an iterated MP-maximizer are also provided.