Creating competition out of thin air: An experimental study of right-to-choose auctions

This paper presents an experimental study of a mechanism that is commonly used to sell multiple heterogeneous goods. The novel feature of this procedure is that instead of selling each good in a separate auction, the seller executes a single auction in which buyers, who may be interested in completely different goods, compete for the right to choose a good. We provide experimental evidence that a Right-to-Choose (RTC) auction can generate more revenue than the theoretically optimal auction. Moreover, in contrast to the “optimal” auction, the RTC auction is approximately efficient in the sense that the surplus it generates is close to the maximal one. Furthermore, a seller who would like to retain some of his goods can generate more revenue with a restricted RTC auction in which not all rights-to-choose are sold, than with the theoretically optimal auction.     

Multiple-unit English auctions

This paper examines the outcome of an ascending-price multiple-unit auction. Two bidders, facing continuous, downward-sloping demand functions, participate in the auction of some divisible objects. The auctioneer starts the process by announcing an initial price and asking both bidders to submit sealed-bids of desired quantities. The auctioneer increases the price until the total amount bid for is less than the total supply. We compute the outcome of this auction game under full information and suggest that this mechanism may not maximize expected revenue.     

Ascending prices and package bidding: Further experimental analysis

We explore the performance of multi-round, price-guided combinatorial auctions for a previously untested class of value profiles in which synergies arise from shared fixed costs. We find that, in many cases, a simulator that bids straightforwardly does well in predicting auction performance, but exceptions arise because human bidders sometimes rely on cues besides prices to guide their package selection and because they sometimes bid aggressively on items for which they have no value in order to increase payments by bidders seeking complementary packages. In our experiments, this latter behavior not only raises prices, but can also improve efficiency by mitigating the threshold problem. Comparisons between a combinatorial clock auction (CCA) and a simultaneous ascending auction (SAA) are reported.     

A Sealed-Bid Auction That Matches the English Auction

This paper analyzes a two-stage sealed-bid auction that is frequently employed in privatization, takeover, and merger and acquisition contests. This auction format yields the same expected revenue as the open ascending (English) auction, yet is less susceptible to preemptive bidding and collusion. Journal of Economic Literature Classification Number: D44.     

Expected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints

We show that all-pay auctions dominate first-price sealed-bid auctions when bidders face budget constraints. This ranking is explained by the fact that budget constraints bind less frequently in the all-pay auctions, which leads to more aggressive bidding in that format.     

Truthful approximation mechanisms for restricted combinatorial auctions

When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness).We develop a set of techniques that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case). For this case we extend the work of Lehmann, O'Callaghan, and Shoham, who presented greedy heuristics. We show how to use If-Then-Else constructs, perform a partial search, and use the LP relaxation. We apply these techniques for several canonical types of combinatorial auctions, obtaining truthful mechanisms with provable approximation ratios.     

Ascending auctions for multiple objects: the case for the Japanese design

Summary. We consider two ascending auctions for multiple objects, namely, an English and a Japanese auction, and derive a perfect Bayesian equilibrium of the Japanese auction by exploiting its strategic equivalence with the survival auction, which consists of a finite sequence of sealed-bid auctions. Thus an equilibrium of a continuous time game is derived by means of backward induction in finitely many steps. We then show that all equilibria of the Japanese auction induce equilibria of the English auction, but that many collusive or signaling equilibria of the English auction do not have a counterpart in the Japanese auction.Received: 2 September 2004, Revised: 20 April 2005, JEL Classification Numbers: C72, D44.Fabrizio Germano: Correspondence toWe are indebted to Philippe Jehiel for useful discussions and to Nicolas Vieille for suggestions in the proof of Proposition 2; we also thank seminar audiences in Athens, Basel, Beer-Sheva, Berlin, Brussels, Cambridge, Edinburgh, Exeter, Lausanne, Lisbon, London, Louvain-la-Neuve, Namur and Tel Aviv. Germano acknowledges financial support from Euopean Commission, TMR Network Grant ERBFMRXCT0055, “Cooperation and Information” as well from the Spanish Ministry of Science and Technology, Grants SEC2001-0792, SEJ2004-06319, and in form of a Ramon y Cajal Fellowship. Lovo is member of GREGHEC, unité CNRS, FRE-2810. The support of the Economic and Social Research Council (ESRC) is also gratefully acknowledged. The work was part of the programme of the ESRC Research for Economic Learning and Social Evolution.     

Allocating multiple units

Summary. This paper studies the allocation and rent distribution in multi-unit, combinatorial-bid auctions under complete information. We focus on the natural multi-unit analogue of the first-price auction, where buyers bid total payments, pay their bids, and where the seller allocates goods to maximize his revenue. While there are many equilibria in this auction, only efficient equilibria remain when the truthful equilibrium restriction of the menu-auction literature is used. Focusing on these equilibria we first show that the first-price auction just described is revenue and outcome equivalent to a Vickrey auction, which is the multi unit analogue of a second-price auction. Furthermore, we characterize these equilibria when valuations take a number of different forms: diminishing marginal valuations, increasing average valuations, and marginal valuations with single turning points. Received: December 23, 1999; revised version: December 10, 2001     

A comparison of first price multi-object auctions

We compare simultaneous multi-object English-type ascending price auctions with first price sealed bid auctions in private values environments with multi-object demands. Special attention is paid to the effect of closing rules on ascending auctions’ outcomes. We find that simultaneous ascending auctions with the soft closing rule are the most efficient, while the sealed bid auctions generate the highest revenue. Ascending auctions with the hard closing rule display a significant amount of late bidding, resulting in the lowest among the three institutions revenue and efficiency.

---

Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.      

Strategic Analysis of High-tech Auctions

This paper deals with the security voting structure in an auction mechanism used to sell an item Of high-tech. The design of security voting structure allows the seller to choose between two objectives that are not mutually consistent. However, if the seller wants to maximize his revenue, he should retain some shares to benefit from the future dividends generated by the acquirer. In addition, if he wants to sell his high-tech to the most efficient candidate, he should sell all the shares.     

Auctioning divisible goods

Summary. We derive equilibrium bidding strategies in divisible good auctions for asymmetrically informed risk neutral and risk averse bidders when there is random noncompetitive demand. The equilibrium bid schedules contain both strategic considerations and explicit allowances for the winner's curse. When the bidders' information is symmetric, the strategic aspects of bidding imply that there always exist equilibria of a uniform-price auction with lower expected revenue than provided by a discriminatory auction. When bidders are risk averse, there may exist equilibria of the uniform-price auction that provide higher expected revenue than a discriminatory auction. Received: November 4, 1999; revised version: March 9, 2001     

Auctions with variable supply: Uniform price versus discriminatory

We examine an auction in which the seller determines the supply after observing the bids. We compare the uniform price and the discriminatory auction in a setting of supply uncertainty, where uncertainty is caused by the interplay of two factors: the seller's private information about marginal cost and the seller's incentive to sell the profit-maximizing quantity, given the received bids. In every symmetric mixed strategy equilibrium, bidders submit higher bids in the uniform price auction than in the discriminatory auction. In the two-bidder case, this result extends to the set of rationalizable strategies. As a consequence, we find that the uniform price auction generates a higher expected revenue for the seller and a higher trade volume.     

Auction Design for the Allocation of Emission Permits in the Presence of Market Power

To the extent that emission permits have been allocated using market mechanisms, this has been done using a sealed-bid auction design, typically with discriminatory prices. However, several authors have recommended the ascending auction format. Basically, two competing ascending auction designs have been suggested, the standard ascending auction (with clock or demand schedules), or an alternative ascending-clock implementation of Vickrey-pricing. The latter design was introduced as a response to problems of bid shading under the sealed-bid and the standard ascending auction format. The purpose of this paper is to investigate the allocation of permits under these two alternative mechanisms. The auction process and the resulting market outcome in the presence of oligopolistic competition are simulated. In this setting, it is not obvious that bid shading is the optimal strategy under the standard design, nor is it obvious that sincere bidding is the optimal strategy under the alternative ascending auction design. The alternative auction format makes it less costly to pursue a strategy to increase market shares through the acquisition of emission permits, thus increasing the competitor's costs, leading to overbidding as the optimal strategy.     

Vickrey auctions with reserve pricing

Summary. We generalize the Vickrey auction to allow for reserve pricing in a multi-unit auction with interdependent values. In the Vickrey auction with reserve pricing, the seller determines the quantity to be made available as a function of the bidders' reports of private information, and then efficiently allocates this quantity among the bidders. Truthful bidding is a dominant strategy with private values and an ex post equilibrium with interdependent values. If the auction is followed by resale, then truthful bidding remains an equilibrium in the auction-plus-resale game. In settings with perfect resale, the Vickrey auction with reserve pricing maximizes seller revenues.Received: 31 December 2002, Revised: 5 May 2003, JEL Classification Numbers: D44, C78, D82.Correspondence to: Lawrence M. AusubelThe authors gratefully acknowledge the generous support of National Science Foundation Grants SES-97-31025, SES-01-12906 and IIS-02-05489. We appreciate valuable comments from Ilya Segal. Special thanks go to Mordecai Kurz, who served as Larry's dissertation advisor and who introduced both authors to the economics profession back at IMSSS at Stanford. Congratulations and best wishes are extended to Mordecai and his family on the happy occasion of the publication of Assets, Beliefs, and Equilibria in Economic Dynamics: Essays in Honor of Mordecai Kurz, in which this article also appears.     

Explaining Overbidding in First Price Auctions Using Controlled Lotteries

In this paper, we study the behavior of individuals when facing two different, but incentive-wise identical, institutions. We pair the first price auction with an equivalent lottery. Once a subject is assigned a value for the auctioned object, the first price auction can be modeled as a lottery in which the individual faces a given probability of winning a certain payoff. This set up allows us to explore to what extent the misperception of the probability of winning in the auction is responsible for bidders in a first price auction to bidding above the risk neutral Nash equilibrium prediction. The first result we obtain is that individuals, even though facing the same choice over probability/payoff pairs, behave differently depending on the type of choice they are called to make. When facing an auction, subjects with high values tend to bid significantly above the bid they choose in the corresponding lottery environment. We further find that in both the lottery and the auction environments, subjects tend to bid in excess of the bid predicted by the risk neutral model, at least for intermediate range values. Finally, we find that the difference between the lottery behavior and the auction behavior is substantially, but not totally, eliminated by showing the subjects the probability of winning the auction.     

Liquidity provision vs. deposit insurance: preventing bank panics without moral hazard

Equilibrium bidding strategies under most multi-unit auction rules cannot be obtained as closed form expressions. Research in multi-unit auctions has, therefore, depended on implicit characterization of equilibrium strategies using the first-order conditions of the bidders’ expected payoff maximization problem. In this paper we consider the pay-as-bid auction with diminishing marginal values for two units and show that any symmetric equilibrium in continuous strategies has the necessary properties to allow such a characterization. Moreover, any increasing solution to the system of differential equations that is used to characterize the equilibrium strategies describes an equilibrium strategy.Generous suggestions and comments from Richard Engelbrecht-Wiggans, Charles M. Kahn, and an anonymous referee are gratefully acknowledged.     

Laboratory Behavior in Spot and Forward Auction Markets

Auctions that require advance production increase seller costs because inventories must be held. This cost does not exist in production-to-demand markets for which production follows trading, and sales exactly match quantities produced. Data from laboratory computerized double auction markets show that advance-production prices are significantly higher and quantities traded are significantly lower than they are in production-to-demand auctions. Price convergence patterns show advance-production sellers moving toward 9% higher prices and 22% greater earnings.     

Multi-stage sequential all-pay auctions

We study multi-stage sequential all-pay contests (auctions) where heterogeneous contestants are privately informed about a parameter (ability) that affects their cost of effort. We characterize the perfect Bayesian equilibrium of these contests and analyze the effect of the number of contestants and their types on the contestants׳ expected highest effort.     

Sequential vs. single-round uniform-price auctions

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k₁ objects are sold in the first round and k₂ in the second round, with and without revelation of the first-round winning bids. We demonstrate that auctioning objects in sequence generates a lowballing effect that reduces the first-round price. Total revenue is greater in a single-round, uniform auction for k=k₁+k₂ objects than in a sequential uniform auction with no bid announcement. When the first-round winning bids are announced, we also identify a positive informational effect on the second-round price. Total expected revenue in a sequential uniform auction with winning-bids announcement may be greater or smaller than in a single-round uniform auction, depending on the model's parameters.     

Late and multiple bidding in second price Internet auctions: Theory and evidence concerning different rules for ending an auction

In second price Internet auctions with a fixed end time, such as those on eBay, many bidders submit their bids in the closing minutes or seconds of an auction. We propose an internet auction model, in which very late bids have a positive probability of not being successfully submitted, and show that late bidding in a fixed deadline auction can occur at equilibrium in auctions both with private values and with uncertain, dependent values. Late bidding may also arise out of equilibrium, as a best reply to incremental bidding. However, the strategic advantages of late bidding are severely attenuated in auctions that apply an automatic extension rule such as auctions conducted on Amazon. Field data show that there is more late bidding on eBay than on Amazon, and this difference grows with experience. We also study the incidence of multiple bidding, and its relation to late bidding.