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.     

Empirical implementation of nonparametric first-price auction models

Nonparametric estimators provide a flexible means of uncovering salient features of auction data. Although these estimators are popular in the literature, many key features necessary for proper implementation have yet to be uncovered. Here we provide several suggestions for nonparametric estimation of first-price auction models. Specifically, we show how to impose monotonicity of the equilibrium bidding strategy; a key property of structural auction models not guaranteed in standard nonparametric estimation. We further develop methods for automatic bandwidth selection. Finally, we discuss how to impose monotonicity in auctions with differing numbers of bidders, reserve prices, and auction-specific characteristics. Finite sample performance is examined using simulated data as well as experimental auction data.     

Econometric models of asymmetric ascending auctions

We develop econometric models of ascending (English) auctions which allow for both bidder asymmetries as well as common and/or private value components in bidders’ underlying valuations. We show that the equilibrium inverse bid functions in each round of the auction are implicitly defined (pointwise) by a system of nonlinear equations, so that conditions for the existence and uniqueness of an increasing-strategy equilibrium are essentially identical to those which ensure a unique and increasing solution to the system of equations. We exploit the computational tractability of this characterization in order to develop an econometric model, thus extending the literature on structural estimation of auction models. Finally, an empirical example illustrates how equilibrium learning affects bidding during the course of the auction.     

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

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

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     

On the lowest-winning-bid and the highest-losing-bid auctions

Theoretical models of multi-unit, uniform-price auctions assume that the price is given by the highest losing bid. In practice, however, the price is usually given by the lowest winning bid. We derive the equilibrium bidding function of the lowest-winning-bid auction when there are k objects for sale and n bidders with unit demand, and prove that it converges to the bidding function of the highest-losing-bid auction if and only if the number of losers n−k gets large. When the number of losers grows large, the bidding functions converge at a linear rate and the prices in the two auctions converge in probability to the expected value of an object to the marginal winner.     

Perseverance and suspense in tug-of-war

We study a tug-of-war game between two players using the lottery contest success function (CSF) and a quadratic cost (of effort) function. We construct a pure strategy symmetric Markov perfect equilibrium of this game, show that it is unique, and provide closed-form solutions for equilibrium strategies and values. In stark contrast to a model of tug-of-war with an all-pay auction CSF, players exert positive efforts until the very last battle in this equilibrium. We deliver a set of empirically appealing results on effort dynamics.     

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.     

Multiple and last-minute bidding in competing internet auctions

The present paper proposes a theoretical model of the equilibrium bidding behavior in simultaneous competing private-value Internet auctions such as those on eBay. It shows that last-minute bidding and multiple bidding, two commonly observed bidding strategies, arise in equilibrium. It also suggests that last-minute bidding may lead to inefficient outcomes.     

On the strictly descending multi-unit auction

We analyze the bidding behavior in a strictly descending multi-unit auction where the price decreases continuously without going back to the initial start price once an object is sold. We prove that any equilibrium in the multi-unit descending auction is inefficient. We derive a symmetric equilibrium for general distribution functions as well as an arbitrary number of bidders and objects. Moreover, equilibrium bidding is characterized by a set of initial value problems. Our analysis thus generalizes previous results in the literature.     

上海市土地使用权出让机制改革研究——基于拍卖理论和上海市土地市场的实证检验

2007年上海市规定住宅用地挂牌出让的现场竞价规则由公开叫价改为一次性书面报价,旨在降低上海市住宅用地的价格.本文在价值相容和可显示信息的假设下,分别建立两阶段升价拍卖模型和混合拍卖模型,刻画改革前后的挂牌机制,指出:竞标者的均衡策略可解释土地挂牌出让中开发商集中在现场竞价阶段内出价,且更倾向在混合拍卖中隐藏信息的行为;当竞价过程中更易于显示信息时,混合拍卖的期望收入低于两阶段升价拍卖,这表明混合拍卖方式能够降低土地价格.上海市的土地交易数据也证明了这一结论.     

Deadlines in stochastic contests

We consider a two-player contest model in which breakthroughs arrive according to privately observed Poisson processes. Each player’s process continues as long as she exerts costly effort. The player who collects the most breakthroughs until a predetermined deadline wins a prize.We derive Nash equilibria of the game depending on the deadline. For short deadlines, there is a unique equilibrium in which players use identical cutoff strategies, i.e., they continue until they have a certain number of successes. If the deadline is long enough, the symmetric equilibrium distribution of an all-pay auction is an equilibrium distribution over successes in the contest. Expected efforts may be maximal for a short or intermediate deadline.     

Bundling and the Reduction of the Winner's Curse

The paper studies the effects of bundling on the bidding strategies and seller revenues in auctions when the bidders have common values for the objects. Bundling of objects before the auction reduces the problem of the winner's curse, and the bidders bid more aggressively. This does not mean that a bundled auction is always better for the seller's revenue. Indeed, there is another effect that makes the bundled auction preferable (from the seller's standpoint) if and only if the number of bidders is small. While this is the only effect present in an independent-private-values model, it does not vanish when bidders have pure common values for the objects. The paper concludes that a bundled auction is unambiguously better for the seller than separate auctions when the number of bidders is small.     

Maximizing bidder surplus in simultaneous online art auctions via dynamic forecasting

This paper presents a novel intelligent bidding system, called SOABER (Simultaneous Online Auction BiddER), which monitors simultaneous online auctions of high-value fine art items. It supports decision-making by maximizing bidders’ surpluses and their chances of winning an auction. One key element of the system is a dynamic forecasting model, which incorporates information about the speed of an auction’s price movement, as well as the level of competition both within and across auctions. Other elements include a wallet estimator, which gauges the bidders’ willingness to pay, and a bid strategizer, which embeds the forecasting model into a fully automated decision system. We illustrate the performance of our intelligent bidding system on an authentic dataset of online art auctions for Indian contemporary art. We compare our system with several simpler ad-hoc approaches, and find it to be more effective in terms of both the extracted surplus and the resulting winning percentage.     

Trading places: An experimental comparison of reallocation mechanisms for priority queuing

In a laboratory experiment, we compare two auction mechanisms that are designed to improve a queue's efficiency by allowing customers to trade places. In the server‐initiated auction, the server, when idle, sells the right to be served next to the highest bidding customer in the queue and distributes the proceeds among the remaining customers. In the customer‐initiated auction, new arrivals can sequentially trade places with queued customers. We use two novel experimental protocols to examine the behavioral properties of both auction mechanisms. We find that both auction mechanisms improve a queue's efficiency on average and that both perform equally well in terms of efficiency gain. We also find evidence of the sunk‐cost effect but not of the endowment effect. Participants indicated that they found the server‐initiated auction a fairer mechanism than the customer‐initiated auction. When voting between the two auctions, the participants tended to favor the server‐initiated auction.     

A final price prediction model for english auctions: a neuro-fuzzy approach

Online auction has now been a popular mechanism in setting prices for internet users. However, auction price prediction, involving the modeling of uncertainty regarding the bidding process, is a challenging task primarily due to the variety of factors changing in auction settings. Even if all the factors were accounted for, there still exist uncertainties in human behavior when bidding in auctions. In this paper, three models, regression, neural networks and neuro-fuzzy, are constructed to predict the final prices of English auctions, using real-world online auction data collected from Yahoo-Kimo Auction. The empirical results show that the neuro fuzzy system can catch the complicated relationship among the variables accurately much better than the others, which is of great help for the buyers to avoid overpricing and for the sellers to facilitate the auction. Besides, the knowledge base obtained from neuro fuzzy provides the elaborative relationship among the variables, which can be further tested for theory building.     

Asymmetry in first‐price auctions with affiliated private values

Collusion and heterogeneity across firms may introduce asymmetry in bidding games. A major difficulty in asymmetric auctions is that the Bayesian Nash equilibrium strategies are solutions of an intractable system of differential equations. We propose a simple method for estimating asymmetric first‐price auctions with affiliated private values. Considering two types of bidders, we show that these differential equations can be rewritten using the observed bid distribution. We establish the identification of the model, characterize its theoretical restrictions, and propose a two‐step non‐parametric estimation procedure for estimating the private value distributions. An empirical analysis of joint bidding in OCS auctions is provided. Copyright © 2003 John Wiley & Sons, Ltd.     

The Auction Price of Apartments in Moscow: Hedonic Estimation in Disequilibrium1

The purpose of this paper is to see how economic factors determine prices in the previously communist countries undergoing privatization. This does not concern the auctions of big state enterprises where the prices are found to be rigged. In this paper we estimate hedonic price functions based on a unique data set on auction prices of apartments in Moscow. We collected the data ourselves by attending the auctions and gathered data on the characteristics. We estimated the hedonic equations using a disequilibrium approach because no equilibrium prices were observed for large number of apartments that were withdrawn from the auction. We found that, as the privatization of residential housing was carried out, the hedonic price equations fit the data remarkably well.     

Keyword auctions with budget-constrained bidders

We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman et al. (Am Econ Rev 97(1):242–259, 2007) and Varian (Int J Ind Organ 25(6):1163–1178, 2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price auctions. However, bidders often have to set their daily budgets when they participate in an auction; once a bidder’s payment reaches his budget, he drops out of the auction. This raises an important strategic issue that has been overlooked in the previous literature: Bidders may change their bids to inflict higher prices on their competitors because under generalized second-price, the per-click price paid by a bidder is the next highest bid. We provide budget thresholds under which equilibria analyzed in Edelman et al. (Am Econ Rev 97(1):242–259, 2007) and Varian (Int J Ind Organ 25(6):1163–1178, 2007) are sustained as “equilibria with budget constraints” in our setting. We then consider a simple environment with one position and two bidders and show that a search engine’s revenue with budget constraints may be larger than its revenue without budget constraints.