Sealed bid auctions with ambiguity: Theory and experiments

This study presents a laboratory experiment of the first and second price sealed bid auctions with independent private values, where the distribution of bidder valuations may be unknown. In our experimental setting, in first price auctions, bids are lower with the presence of ambiguity. This result is consistent with ambiguity loving in a model that allows for different ambiguity attitudes. We also find that the first price auction generates significantly higher revenue than the second price auction with and without ambiguity.     

Second chance offers versus sequential auctions: theory and behavior

Second chance offers in online marketplaces involve a seller conducting an auction for a single object and then using information from the auction to offer a losing bidder a take-it-or-leave-it price for another unit. We theoretically and experimentally investigate this practice and compare it to two sequential auctions. We show that the equilibrium bidding strategy in the second chance offer mechanism only exists in mixed strategies, and we observe that this mechanism generates more profit for the auctioneer than two sequential auctions. We also observe virtually no rejections of profitable offers in the ultimatum bargaining stage.      

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.     

Asymmetric first-price auctions with uniform distributions: analytic solutions to the general case

In 1961, Vickrey posed the problem of finding an analytic solution to a first-price auction with two buyers having valuations uniformly distributed on ${[\underline{v}_{1}, \overline{v}_{1}]}$ and ${[\underline{v}_{2}, \overline{v}_{2}]}$ . To date, only special cases of the problem have been solved. In this paper, we solve this general problem and in addition allow for the possibility of a binding minimum bid. Several interesting examples are presented, including a class where the two bid functions are linear.     

Information acquisition in auctions: Sealed bids vs. open bids

This paper studies the incentives of a bidder to acquire information in an auction when her information acquisition decision is observed by the other bidders before bidding. Our results show that the sealed bid (second price) auction may induce more information acquisition about a common component of the value than the open (English) auction but less about the private component of the value. Moreover, we show that more information about the private value and less information about the common value may improve efficiency and revenue. Consequently, our results suggest new arguments in favor of the open auction.     

Cost overrun and auction format in small size public works

We study the effect on cost overruns of two different auction formats, the first price sealed bid and the average bid, conditional on whether entry is open or restricted. The first price format awards the contract to the lowest bid, while the average bid format awards the contract to the bid closest to the average of all the bids. This latter format is supposed to prevent an unreliable low bidder from winning the auction; as a consequence cost overruns should be lower under the average bid than under the first price format. We test this hypothesis with a panel data set of auctions held in the Italian Veneto region between 2004 and 2006, including small size public projects in sectors such as road works and building maintenance. We find that cost overruns are lower under the average bid format, but only when the entry is restricted. We then speculate on possible explanations for this result.     

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 choice of auction format in seller cheating: a signaling game analysis

In this paper, we examine which auction format, first-price or second-price, a seller will choose when he can profitably cheat in a second price auction by observing all bids by possible buyers and submitting a shill bid as pretending to be a buyer. We model this choice of auction format in seller cheating as a signaling game in which the buyers may regard the selection of a second price auction by the seller as a signal that he is a shill bidder. By introducing trembling-hand perfectness as a refinement of signaling equilibrium, we find two possible strictly perfect signaling equilibria. One is a separating equilibrium in which a noncheating honest seller selects a first price auction and a cheating seller does a second price auction. In another pooling equilibrium, however, both cheating and non-cheating sellers select a second price auction. The conclusion that a seller chooses a second price auction even if he cannot cheat is in contrast to the previous literature, which focused on the case of independent values. We thank an anonymous referee for useful comments that have improved the paper. This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (B) 15310023 and (C) 18530139.     

Asymptotic and small sample analysis of the stochastic properties and certainty equivalents of winning bids in independent private values auctions$\!$

Summary. This paper investigates the stochastic properties of the first price and second price winning bids in auctions with risk neutral bidders with independent and identically distributed valuations. In such an environment, the winning first price bids second order stochastically dominate the second price winning bids. A key result of this paper is that the ratio of the variance of the winning first price bid to that of the winning second price bid is strictly less than one even as the number of bidders goes to infinity. This suggests that the stochastic dominance of the winning first price bids does not vanish even in the limit. Both the asymptotic and small sample properties of winning bids are investigated. In particular, the small sample results suggest that the identification power of econometric procedures that rely on winning bids can decline rapidly as the number of bidders increases. This paper also includes a systematic evaluation of the difference in certainty equivalents between the two auction formats for several common distributions and number of bidders for the case of auctioneers with constant coefficient of absolute risk aversion. These results are presented in a form that makes it easy to apply them to a specific auction of interest.Received: 15 July 2002, Revised: 7 April 2003, JEL Classification Numbers: D44.I would like to thank David Pearce for helpful comments and discussion and a referee for suggestions that have greatly improved this paper.     

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.     

Reserve Prices without Commitment

When potential bidders in an auction have to incur a cost to prepare their bids and thus to learn their valuations, imposing a reserve price and announcing that in case no bid is submitted there will be another auction without a reserve price is both revenue and welfare improving. Reserve prices that induce less than maximum entry in the first auction may be optimal. Also, entry fees are not necessarily better instruments than reserve prices.Journal of Economic LiteratureClassification Number: D44.     

Sequential negotiations with costly information acquisition

Negotiations about a merger or acquisition are often sequential and only partially disclose to bidders information about each otherʼs bids. This paper explains the seller optimality of partial disclosure in a single-item private-value auction with two bidders. Each bidder can inspect the item at a nonprohibitive cost. If a revenue-maximizing seller cannot charge bidders for the information about the otherʼs bid, then the seller optimally runs a sequential second-price auction with a reserve price and a buy-now price. The seller prefers to keep the bids confidential and, sometimes, to hide the order in which he approaches the bidders.     

Bid Functions in Auctions and Fair Division Games: Experimental Evidence

In auctions a seller offers a commodity for sale and collects the revenue. In fair division games the object is collectively owned by the group of bidders who equally share the revenue. We run an experiment in which the participants face four types of allocation games (auctions and fair division game under two price rules, first– versus second–price rule). We collect entire bid functions rather than bids for single values and investigate price and efficiency of the different trading institutions. We find that the first–price auction is more efficient than the second–price auction, whereas economic rationality assuming heterogeneous bidders suggests the opposite. Furthermore, we study the structure of individual bid functions.     

Auctions in which losers set the price

We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers' bids. In particular, we show that the kth price auction generates higher revenue than the second-price auction, for all k>2. If rationing is allowed, with shares of the asset rationed among the t highest bidders, then the (t+1)st price auction yields the lowest revenue among all auctions with rationing in which only the winners pay and the unit price only depends on the losers' bids. Finally, we compute bidding functions and revenue of the kth price auction, with and without rationing, for an illustrative example much used in the experimental literature to study first-price, second-price and English auctions.     

The high/low divide: Self-selection by values in auction choice

Most prior theoretical and experimental work involving auction choice has assumed bidders find out their value after making a choice of which auction to enter. We examine whether or not bidders knowing their value prior to making a choice of which among multiple alternative auction formats to enter impacts their choice decision and/or the outcome of the auctions. The results show a strong impact on auction choice. Subjects with low values choose the first price sealed bid auction more often while subjects with high values choose the ascending auction more often. The number of bidders in each auction, revenue, efficiency and average bidder surplus all end up equalized.     

Collusion in one-shot second-price auctions

Summary. Most of the literature on collusive behavior in auctions ignores two important issues that make collusion difficult to sustain at least in one-shot interactions: the detection of cheating and the verification of bids. Colluding bidders may deceive each other by using shill bidders. Also, if the identities of the bidders and their bids are not published then it would be difficult to verify the bid of a colluding bidder. This paper addresses these problems in one shot second price auctions where one bidder offers another bidder a side payment in exchange for not participating in the auction, while the number of other bidders is stochastic. In spite of the barriers to collusion mentioned above, a simple side payment mechanism which depends only on the auction price is introduced. It induces a successful collusion, eliminates the verification problem, provides no incentive for the use of shill bidders and guarantees that the proponent obtains ex-post non-negative payoff. The colluding bidders are ex-ante strictly better off compared with the competitive case, irrespective of their types.Received: 27 November 2002, Revised: 28 January 2005, JEL Classification Numbers: C72, D44, D82.Yair Tauman: Correspondence toWe would like to thank an anonymous referee for very valuable comments and suggestions that significantly improved the paper. We thank Shmuel Zamir for a helpful discussion.     

The effectiveness of English auctions

We study the performance of the English auction under different assumptions about the seller's degree of “Bayesian sophistication.” We define the effectiveness of an auction as the ratio between the expected revenue it generates for the seller and the expected valuation of the object to the bidder with the highest valuation (total surplus). We identify tight lower bounds on the effectiveness of the English auction for general private-values environments, and for private-values environments where bidders' valuations are non-negatively correlated. For example, when the seller faces 12 bidders who the seller believes have non-negatively correlated valuations whose expectations are at least as high as 60% of the maximal possible valuation, an English auction with no reserve price generates an expected price that is more than 80% of the value of the object to the bidder with the highest valuation.     

Multidimensional private value auctions

We consider parametric examples of symmetric two-bidder private value auctions in which each bidder observes her own private valuation as well as noisy signals about her opponent's private valuation. We show that, in such environments, the revenue equivalence between the first and second price auctions (SPAs) breaks down and there is no definite revenue ranking; while the SPA is always efficient allocatively, the first price auction (FPA) may be inefficient; equilibria may fail to exist for the FPA. We also show that auction mechanisms provide different incentives for bidders to acquire costly information about opponents’ valuation.     

The Effect of Bidder Heterogeneity on Combinatorial Conservation Auction Designs

In an iterative combinatorial auction, bidders can submit bids on individual and/or on combinations of projects in a series of intermediate rounds, where bid prices are revised before a final allocation is made. The iterative format is useful for conservation service procurement as landholders can rely on market information revealed through the rounds to evaluate their choices of projects and bid prices. However, there is no single way of providing the market information. Different designs for generating price information have been proposed. Little is known about the performance of iterative combinatorial auction designs when heterogeneous bidders, with different cost structures, participate in an auction. Using an agent based model, we evaluate a selected set of designs under different bidder heterogeneity scenarios. We observe that higher degrees of heterogeneity lead to lower auction efficiency and that auction outcomes are highly sensitive to price feedback design choices.     

A Simple Model of Expert and Non-Expert Bidding in First-Price Auctions

This paper studies the equilibrium bidding behavior in a first-price sealed-bid auction when the number of informed bidders is not common knowledge. Both the independent private values and the common value cases are analyzed, under the assumption that a “neutral” signal exists. In equilibrium, experts and non-experts draw their bids from distinct supports: experts bid in the upper and lower tail of the bidding distribution and non-experts randomize their bids in between. For common values, it is shown that the seller's expected revenue always decreases with the probability of a bidder being informed when this probability is small. The opposite result is shown for the case of independent private values.Journal of Economic LiteratureClassification Numbers: D44, D82.