Existence of optimal auctions in general environments

We provide a unified approach to the problem of existence of optimal auctions for a wide variety of auction environments. We accomplish this by first establishing a general existence result for a particular Stackelberg revelation game. By systematically specializing our revelation game to cover various types of auctions, we are able to deduce the existence of optimal Bayesian auction mechanisms for single and multiple unit auctions, as well as for contract auctions with moral hazard and adverse selection. In all cases, we allow for risk aversion and multidimensional, stochastically dependent types.     

Sudden Termination Auctions—An Experimental Study

The design of online markets has become a major issue due to the capability of operators to implement almost any set of market rules overnight. With this study we contribute to the literature of auction market design by presenting a theoretical and experimental analysis of sudden termination auctions. Our main focus is on the candle auction that has a positive termination probability at any time in the course of the auction. Candle auctions prove to be a much faster, but equally efficient alternative to standard hard close auctions.     

Learning through Simultaneous Play: Evidence from Penny Auctions

This paper contributes to the emerging empirical literature on penny auctions, a particular type of all‐pay auctions. We focus on the potential learning effects that bidders may experience over time but also (and particularly) across auctions as a result of their auction participation. Using detailed bid‐level information, we find that, similarly to earlier literature, bidders suffer from a sunk cost fallacy, whereby their probability of dropping out of an auction is decreasing in the number of bids they have already placed in that auction. Although we do find that learning through repeated participation alleviates the sunk cost fallacy, participation in simultaneous penny auctions emerges as a much more effective learning mechanism, ultimately contributing toward bidders earning higher individual surpluses.     

Auctions with resale and bargaining power

We show that when the weak bidder’s bargaining power in the resale market is weakened, the auctioneer’s revenue from the first-price auction with resale is lower. Using the idea of Coase Theorem, we show that when the resale market is a sequential bargaining model with no commitment, the auctioneer’s revenue is substantially reduced, and the ranking is the opposite of Hafalir and Krishna (2009). We establish a version of the Coase Theorem in the context of the auctions with resale. When Coase Theorem holds, we show that the revenue of the auction with resale is lower than the revenue of the same auction without resale. We also provide the existence and uniqueness of equilibrium for our model of auctions with resale.     

Anticipation of Auction Fever: Entry Decision,Reserve Price and the Choice of Auction Design

This paper analyzes the entry decision of rational bidders who expect to experience auction fever in English auctions. It shows that nonparticipation decision reduces seller's expected profit and this effect may outweigh the positive effect of the auction fever. We analyze the choice between English and second‐price sealed‐bid auctions and the optimal reserve price in English auctions. We show that it might be optimal for the seller to set a reserve price below her own valuation of the object. Finally, we show that the order in which bidders place their bids matters and the first bidder always has an advantage. Copyright © 2011 John Wiley & Sons, Ltd.     

Wars of attrition and all-pay auctions with stochastic competition

We extend the war of attrition and all-pay auction analysis of Krishna and Morgan (1997) to a stochastic competition setting. We determine the existence of equilibrium bidding strategies and discuss the potential shape of these strategies. Results for the war of attrition contrast with the characterization of the bidding equilibrium strategies in the first-price all-pay auction as well as the winner-pay auctions. Furthermore we investigate the expected revenue comparisons among the war of attrition, the all-pay auction and the winner-pay auctions and discuss the linkage principle as well. Our findings are applicable to future works on contests and charity auctions.     

Auctions with endogenous participation

We study endogenous-participation auctions where bidders only know the number of potential participants. After seeing their values for the object, potential participants decide whether or not to enter the auction. They may not want to enter the auction since they have to pay participation costs. We characterize equilibrium bidding strategies and entry decisions for both first- and second-price sealed-bid auctions when participation is endogenous. We show that there is a pure strategy entry equilibrium where only bidders with values greater than a certain cut-off point actually bid. In this context, both types of auctions generate the same expected revenue. We also show that, contrary to the predictions of the fixed number of bidders literature, the seller's expected revenue may decrease when the number of potential participants increases. In addition, we show that it is optimal for the seller to charge an entry fee, which contrasts with results from the existing literature on auctions with entry. As in the fixed-n literature, we show that first-price auctions generate more expected revenue than second-price auctions when buyers are risk-averse. Finally, we characterize the optimal auction – the auction that maximizes the seller's expected revenue – by using a direct revelation mechanism. The optimal auction involves a reserve price larger than the optimal reserve price in the fixed-n literature. The winner's payment is the second highest bid less the participation cost and losers receive a subsidy equal to the participation cost. Received: 17 August 1998 / 21 September 1999     

Auctions with asymmetric common-values: The first-price format

We study the performance of the first-price format in auctions with asymmetric common-values. We show that, contrary to the result for second-price auctions, a small advantage for one player translates only to small changes in bidders’ strategies, and the equilibrium remains close to the first-price equilibrium of the original game. We characterize the equilibrium bidding strategies and their behavior as the degree of asymmetry increases. Finally, we compare the revenues at the optimal auction, the first-price auction and the second-price auction.     

He who must not be named

Landsberger et al. have studied a sealed bid first price auction with two players in which the ranking of the valuations is known. They argue that such a situation can arise in a sequential auction where only the name of the winner is revealed. In this paper we consider sequential auctions where two identical goods are sold sequentially to N players who are interested in both objects. In sealed bid auctions, no information is a priori revealed by the mechanism, but the seller can in principle reveal whatever he wants. We restrict our attention to the case where only the name of the winner is revealed to be in the context of Landsberger et al. for the second auction. The aim of the paper is to compare such a sequential auction with a simultaneous auction where both goods are sold as a bundle or equivalently with a sequential auction where no information is revealed. We first show that there exists an equilibrium of the sequential game in pure and monotone strategies. Then, the comparison of the seller's expected revenue in the two cases allows us to conclude that contrary to Landsberger et al.'s predictions, the seller can not use the information to increase his revenue. This result is obtained using simulations for a large class of distribution functions. The seller must not reveal the name of the winner between the two auctions and instead sell both goods using a simultaneous auction.Received: 31 July 2001, Accepted: 5 February 2003, JEL Classification: B44I wish to thank Laurent Linnemer, Thomas Ricke, Michael Visser and Shmuel Zamir for helpful comments and suggestions. I am very grateful to the referees and the associated editors in charge of my paper.     

Semiparametric identification and estimation in multi-object,English auctions

Within the independent private-values paradigm, we derive the data-generating process of winning bids for two different objects sold sequentially at English auction, assuming the valuations across objects for a particular bidder are potentially dependent. We demonstrate that, within the Archimedean family of copulas, the model is identified using only observed winning bids, and then propose a semiparametric estimation strategy to recover the joint distribution of valuations. We implement our methods using data from fish auctions held in Denmark and estimate whether bundling is expected-revenue enhancing.     

Corners in Auctions

Different pricing rules in multiunit auctions provide different incentives for a bidder to corner the auction and thus require different levels of effort from the seller to deter cornering. We consider three different types of auctions: the pay-your-bid or "discriminatory" auction commonly used by the US Treasury, the lowest-winning-bid uniform-price auction used in the current Treasury experiment, and the highest-losing-bid uniform-price auction considered by Vickrey almost four decades ago. We show that the pay-your-bid auction provides the greatest incentive to corner the market, that the experimental Treasury auction provides less incentive, and that the highest-losing-bid uniform-price auction provides the least. Arguably, the less the incentive to corner the market, the easier it will be for sellers to deter cornering, and the greater their expected revenue (net of the cost to deter cornering) will be in otherwise expected-revenue-equivalent auctions.     

Revenue and efficiency effects of resale in first-price auctions

We study first-price auctions in a model with asymmetric, independent private values. Asymmetries lead to inefficient allocations, thereby creating a motive for resale after the auction is over. In our model, resale takes place via monopoly pricing—the winner of the auction makes a take-it-or-leave-it offer to the loser. Our goal is to compare equilibria of the first-price auction without resale (FPA) with those of the first-price auction with resale (FPAR). For the three major families of distributions for which equilibria of the FPA are available in closed form, we show that resale possibilities increase the revenue of the original seller. We also show by example that, somewhat paradoxically, resale may actually decrease efficiency.     

Electronic reverse auction configuration and its impact on buyer price and supplier perceptions of opportunism: A laboratory experiment

Buying organizations are increasingly using electronic reverse auctions (eRAs) to source from suppliers. However, recent quasi-experimental and field research has suggested that the use of this sourcing technique can create perceptions of opportunism among participating suppliers. Yet from the buyer's perspective, online reverse auctions can yield lower purchase prices. Given the many ways in which to configure on-line auctions, we extend existing research by using a laboratory experiment to investigate how different reverse auction configurations jointly influence bid price and suppliers’ perceptions of buyer opportunism.Our findings suggest that supplier bid prices decrease over time as they participate in more eRAs, regardless of the configuration of auction parameters. However, the combination of rank (versus price) visibility, high (versus low) supplier need to win a contract, and six (versus three) competitors was significantly more effective than other combinations of variables in immediately reducing bid prices. The data also indicated that when suppliers’ bids dropped substantially across auctions, their perceptions of opportunism increased. Notably, auction parameter combinations such as price visibility, three competitors, and low need for the contract yielded comparably low bids by the third auction, without any increases in perceived buyer opportunism.     

AUCTIONS: AN INTRODUCTION

Abstract. This is a detailed introduction to auction theory. It begins with a simple analysis of standard auctions and then uses a strikingly simple general solution of symmetric private values auctions to prove the payoff equivalence of many auction rules. The basic framework is then modified to admit risk aversion, multi-unit and repeated auctions as well as collusion. Then follows an introduction to optimal auctions, with and without stochastic entry, and to common value auctions and the winner's curse problem. The survey closes with a sample of applications, from the regulation of natural monopolies to price competition in oligopoly and the government securities market.     

The econometrics of auctions with asymmetric anonymous bidders

We consider standard auction models when bidders’ identities are not-or are only partially-observed by the econometrician. We first adapt the definition of identifiability to a framework with anonymous bids and explore the extent to which anonymity reduces the possibility of identifying private value auction models. Second, in the asymmetric independent private value model which is nonparametrically identified, we generalize Guerre, Perrigne and Vuong’s estimation procedure [Optimal nonparametric estimation of first-price auctions, Econometrica 68 (2000) 525-574] and consider the asymptotic properties of our multi-step kernel-based estimator. Monte Carlo simulations illustrate the practical relevance of our estimation procedure in small data sets.     

Revenue comparison of discrete private-value auctions via weak dominance

We employ weak dominance to analyze both first-price and second-price auctions under the discrete private-value setting. We provide a condition under which the expected revenue from second-price auction is higher than that of first-price auction. We also provide implications for large auctions, including the “virtual” revenue equivalence.     

An empirical model of the multi‐unit,sequential, clock auction

We construct a model of participation and bidding at multi‐unit, sequential, clock auctions when bidders have multi‐unit demand. We describe conditions sufficient to characterize a symmetric, perfect‐Bayesian equilibrium and then demonstrate that this equilibrium induces an efficient allocation. We propose an algorithm, based on the generalized Vickrey auction, to calculate the expected winning bid for each unit sold. This algorithm allows us to construct a simulation‐based estimator of the parameters for both the participation process and the distribution of latent valuations. We apply our method to data from 37 multi‐lot, sequential, English auctions of export permits for timber held in Russia. Copyright © 2006 John Wiley & Sons, Ltd.     

在线拍卖中的代理研究综述

在线拍卖站点的不断增加给在线竞买人提出了具大的挑战,竞买人需要从大量的拍卖站点中选择一个恰当的拍卖站点,以保证在满足他们偏好的前提下得到他们希望的物品。不同的拍卖站点采用的拍卖方式和竞价策略是不同的,因此,不同的拍卖站点其竞价代理的设计策略也不同。本文主要对目前在线拍卖代理研究进行综述。     

Optimal fees in internet auctions

An auction house runs a second-price auction with a possibility of resale through re-auctions. It collects listing and closing fees from the seller. We find the fees which maximize the revenue of the auction house. In particular, we show that the optimal listing fee is zero. Our findings are consistent with the policies of eBay, Amazon, Yahoo, and other Internet auctions.      

Reputation in Auctions: Theory, and Evidence from eBay

Employing a procedure suggested by a simple theoretical model of auctions in which bidders and sellers have observable and heterogenous reputations for default, we examine the effect of reputation on price in a data set drawn from the online auction site eBay. Our main empirical result is that seller's, but not bidder's, reputation has an economically and statistically significant effect on price.