Money Out of Thin Air: The nationwide Narrowband pcs Auction

The Federal Communications Commission held its first auction of radio spectrum at the Nationwide Narrowband PCS Auction in July 1994. The simultaneous multiple-round auction, which lasted five days, was an ascending bid auction in which all licenses were offered simultaneously. This paper describes the auction rules and how bidders prepared for the auction. The full history of bidding is presented. Several questions for auction theory are discussed. In the end, the government collected $617 million for ten licenses. The auction was viewed by all as a huge success an excellent example of bringing economic theory to bear on practical problems of allocating scarce resources.     

Fear of losing in a clock auction

We examine bidding behavior in a clock auction in which price is set by the lowest-accepted bid and provisional winners are reported each round (the LABpw auction). This format was used in the India 3G spectrum auction. In the standard theory, the auction performs poorly. In particular it yields lower revenues and is less efficient than the more standard clock auction with exit bids and highest-rejected-bid pricing (the HRB auction). However, the LABpw auction performs well in the lab, achieving higher revenues than the HRB auction. We show how fear of losing provides one motivation for the overbidding that causes higher revenues in the LABpw auction.     

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.     

Corruption and auctions

We investigate how corruption affects the outcome of a first-price auction (bidding behavior, efficiency and the seller’s expected revenue). The auctioneer approaches the winner to offer the possibility of a reduction in his bid in exchange for a bribe. The bribe can be a percentage of the difference between the winning and the second-highest bid or a fixed amount. We show that there exists a symmetric bidding strategy equilibrium that is monotone, i.e., higher valuation buyers bid higher. Corruption does not affect efficiency but both the auctioneer’s expected bribe and the seller’s expected revenue depend on the format of the bribe payments. We also find the optimal bribe scheme.     

Making More from Less: Strategic Demand Reduction in the FCC Spectrum Auctions

When multiple items are sold through the use of simultaneous ascending-bid auctions, bidders can find it in their mutual interests to reduce their aggregate demand for the items while prices are still low relative to the bidders' valuations. The FCC's first broadband PCS auction provides examples of how such mutual reductions might be arranged even when the bidders are not allowed to communicate with one another outside of the auction arena.     

第二价格密封招标中串谋预防机制研究

第二价格密封拍卖和招标机制作为一种可以使投标人"说真话"的机制受到理论界的广泛关注。本文研究了第二价格密封招标中,如何采用公开保留价机制对投标人平行串谋进行预防。首先建立了第二价格密封招标的串谋组织报价及利润分配机制,然后分析了存在串谋时招标人应采用的公开保留价定价机制,最后研究了串谋组织成员人数与招标公开保留价之间的关系。     

线性合同招标中投标人数的博弈模型研究

在线性合同的假设前提下，论文通过建立模型，求解博弈的贝叶斯均衡得到了风险中性的理性招标人的最优合同形式以及投标人的最优报价策略。最后，论文通过引入招标成本函数，进一步提出了对于招标人控制投标人数从而达到自身目标最优的策略。     

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.     

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

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

论几种特殊合同中的要约与承诺

文章指出,在招投标形式订立合同的过程中,招标属于合同上的要约邀请,投标为要约,定标是承诺,但招标属于必须经过的阶段,投标的撤回随意性比较大,定标采取投邮生效主义。在拍卖订立合同的过程中,各行为的性质视增价拍卖和减价拍卖而有所不同。增价拍卖也会因为有底价拍卖和无底价拍卖的区别而导致行为性质的差异。招股说明书的要式特征,使其虽然不满足要约的条件,但法定成为了要约,而且不可撤回和撤销。     

Optimal decisions in foreign exchange bidding markets

I characterize optimal bidding decisions in bidding markets where each agent does not perceive she can significantly affect the market outcome. Using a foreign exchange bidding framework to provide a micro-foundation for the shape of a bidder's payoff function, I show that (1) in a discriminatory auction a bidder bids for a price that equals the value of the marginal product of her bid quantity, and (2) in a competitive auction a bidder bids for a price that equals the value of the average product of her bid quantity. An example illustrates the comparative properties of these solutions.     

多单位网上拍卖中的托投标分析

在独立私有价值的多单位网上英式拍卖中，诚实的竞标者能够采用对抗性的竞标策略来降低卖者参与托投标的激励，然而即使考虑了诚实竞标者对于托投标的策略性响应，托投标对于卖者而言依然是有利可图的。更为有效地阻止托投标的措施可能包括吸引更多的潜在竞标者，并限制在单次拍卖中销售的物品数量。同时考虑了卖者对于这种对抗性竞标策略的策略响应，求解了卖者的最优托投标，结论表明无论最优的托投标是唯一的还是多重的，卖者的最优策略是在开始使用低的托投标，在观察到之前的竞标信息之后通过动态调整将托投标设定到最优水平。     

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.     

Bidder collusion at first-price auctions

We show that in simple environments, a bidding ring operating at a first-price sealed-bid auction cannot achieve any gains relative to non-cooperative bidding if the ring is unable to control the bids that its members submit at the auction. This contrasts with results for the case in which the ring can control its members’ bids or prevent all but one of the ring members from participating in the auction. Numerical examples suggest that this result extends to some more complex environments. The analytic results use linear programming techniques that have potential applications to a number of other economic problems.     

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

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

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.     

Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions

We examine bid data from the first two broadband PCS spectrum auctions for evidence of value synergies. First, we estimate a benchmark regression for the determinants of final auction prices. Then, we include variables reflecting the extent to which bidders ultimately won or already owned the adjacent wireless properties. Consistent with geographic synergies in an ascending-bid auction, prices were higher when the highest losing bidder had adjacent licenses. The footprints of winning bidders suggest that they were often successful in realizing these synergies.     

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.     

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.     

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.