When curiosity kills the profits: An experimental examination

Economic theory predicts that in a first-price auction with equal and observable valuations, bidders earn zero profits. Theory also predicts that if valuations are not common knowledge, then since it is weakly dominated to bid your valuation, bidders will bid less and earn positive profits. Hence, rational players in an auction game should prefer less public information. We are perhaps more used to seeing these results in the equivalent Bertrand setting. In our experimental auction, we find that individuals without information on each other's valuations earn more profits than those with common knowledge. However, given a choice between the two sets of rules, approximately half the individuals preferred to have the public information. We discuss possible explanations, including showing that there is a correlation between ambiguity aversion and a preference for having more information in the auction.     

Optimal advertising of auctions

We study a symmetric independent private values auction model where the revenue-maximizing seller faces a cost cn of attracting n bidders to the auction. If the distribution of valuations possesses an increasing failure rate (IFR), the seller overinvests in attracting bidders compared to the social optimum. Conversely, if the distribution is DFR, the seller underinvests compared to the social optimum. If the distribution of valuations becomes more dispersed, both, a revenue- and a welfare-maximizing seller, attract more bidders.     

On the continuous equilibria of affiliated-value,all-pay auctions with private budget constraints

We consider all-pay auctions in the presence of interdependent, affiliated valuations and private budget constraints. For the sealed-bid, all-pay auction we characterize a symmetric equilibrium in continuous strategies for the case of N bidders. Budget constraints encourage more aggressive bidding among participants with large endowments and intermediate valuations. We extend our results to the war of attrition where we show that budget constraints lead to a uniform amplification of equilibrium bids among bidders with sufficient endowments. An example shows that with both interdependent valuations and private budget constraints, a revenue ranking between the two auction formats is generally not possible. Equilibria with discontinuous bidding strategies are discussed.     

Banning Bidders from All-pay Auctions

We consider an all-pay auction with complete information among the bidders; the seller does not observe the bidders’ values. We show that for some information structures in which the seller has a small uncertainty about the valuations, it is profitable for him to exclude from the auction all but two (randomly selected) bidders even though the latter are ex ante identical from his point of view.I am grateful to Paolo Bertoletti who introduced me to this topic and provided useful comments. I also thank Dan Kovenock (Co-Editor) and two anonymous referees for suggestions which considerably improved the exposition.     

Bundling decisions for selling multiple objects

Summary. Auctioneers often face the decision of whether to bundle two or more different objects before selling them. Under a Vickrey auction (or any other revenue equivalent auction form) there is a unique critical number for each pair of objects such that when the number of bidders is fewer than that critical number the seller strictly prefers a bundled sale and when there are more bidders the seller prefers unbundled sales. This property holds even when the valuations for the objects are correlated for a given bidder. The results have been proved using a mathematical technique of quantiles that can be extremely useful for similar analysis. Received: November 5, 1996; revised version: January 21, 1998     

Auction fever: Rising revenue in second-price auction formats

The prevalent term “auction fever” visualizes that ascending auctions – inconsistent with theory – are likely to provoke higher bids than one-shot auctions. To explore and isolate causes of auction fever experimentally, we design four different strategy-proof auction formats and order these according to expected rising bids based on pseudo-endowment effect arguments (psychological ownership and disparity between willingness to pay and willingness to accept). Observed revenues in the experiment in the four formats rank as expected if bidders have private uncertain values (the private information of a bidder is the distribution of her value). A control treatment supports our view that the traditional private certain values approach prevents auction fever in the laboratory. Another control treatment with a procurement auction relates the auction fever bids to bids in a one-shot auction with real endowments. We conclude that, when bidders are uncertain about their valuations, auctions that foster pseudo-endowment may raise bids and revenues.     

Auctions with uncertain numbers of bidders

We investigate bidders’ and seller's responses to ambiguity about the number of bidders in the first price auction (FPA) and the second price auction (SPA) with independent private valuations. We model ambiguity aversion using the maxmin expected utility model. We find that bidders prefer the number of bidders to be revealed in the FPA, are indifferent between revealing and concealing in the SPA, and prefer the SPA to the FPA. If bidders are more pessimistic than the seller then the seller prefers to conceal the number of bidders in the FPA, and prefers the FPA to the SPA.     

Information structures in optimal auctions

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal information structures in an optimal auction exhibit a number of properties: (i) information structures can be represented by monotone partitions, (ii) the cardinality of each partition is finite, (iii) the partitions are asymmetric across agents. We show that an optimal information structure exists.     

Optimal Multi-Object Auctions

This paper analyses optimal auctions of several objects. In the first model bidders have a binary distribution over their valuations for each object, in which case the optimal auction is efficient. The optimal auction takes one of two formats: either objects are sold in independent auctions, or a degree of bundling is introduced in the sense that the probability a bidder wins one object is increasing in her value for the other. The format of the optimal auction may depend upon the number of bidders. In the second model the restriction to binary distributions is relaxed, and the optimal auction is then inefficient.     

Auctions with Anticipated Emotions: Overbidding,Underbidding, and Optimal Reserve Prices*

The experimental literature has documented that there is overbidding in second‐price auctions, regardless of the valuations of bidders. In contrast, in first‐price auctions, there tends to be overbidding for large valuations, but underbidding for small valuations. We show that the experimental evidence can be rationalized by a simple extension of the standard auction model, where bidders anticipate (constant) positive or negative emotions caused by the mere fact of winning or losing. Even if the emotional (dis‐)utilities are very small, the revenue‐maximizing reserve price might be significantly different from the standard model. Moreover, decreases with the number of bidders.     

Equilibrium reserve prices in sequential ascending auctions

We study a model where bidders have perfectly correlated valuations for two goods sold sequentially in two ascending-price auctions. The seller sets a reserve price before the beginning of each auction. Despite the lack of commitment by the seller, we characterize an equilibrium and study its properties. Strategic non-disclosure of information takes the form of non-participation in the early auction by low-valuation bidders, while high-valuation bidders bid up to their true valuations. Some buyers who would profitably buy at the reserve price refrain from participating in order to decrease the second-auction reserve price.     

BUNDLING IN AUCTIONS WITH NON‐LINEAR VALUATIONS*

We examine when a revenue‐maximising auctioneer prefers to auction a homogenous product in one bundle (a single‐object auction) than to sell the item in two or more shares. When the items are super‐additive the auctioneer always prefers a single‐object auction. When the product valuations are sub‐additive, the auctioneer is more likely to choose a share auction when there are a large number of potential bidders. When there are a small number of bidders the auctioneer will tend to prefer a single‐object auction.     

Optimal auctions with information acquisition

This paper studies optimal auction design in a private value setting with endogenous information gathering. We develop a general framework for modeling information acquisition when a seller wants to sell an object to one of several potential buyers, who can each gather information about their valuations prior to participation in the auction. We first demonstrate that the optimal monopoly price is always lower than the standard monopoly price. We then show that standard auctions with a reserve price remain optimal among symmetric mechanisms, but the optimal reserve price lies between the ex ante mean valuation of bidders and the standard reserve price in Myerson (1981). Finally, we show that the optimal asymmetric mechanism softens the price discrimination against “strong” bidders.     

An Asymptotic Solution for Sealed Bid Common-Value Auctions with Bidders Having Asymmetric Information

We investigate a first-price common-value auction where bidders have asymmetric information about an item of unknown value. We compute the unique Nash equilibrium when the bidders are constrained to translation-invariant bid functions. Further, this profile of bid functions is also an asymptotic Nash equilibrium (without the constraint on the bidders' strategies) as the a priori distribution of the true value becomes increasingly diffuse. All bidders have positive expected profits at equilibrium. In the second-price analogue with two bidders there is a continuum of Nash equilibria in which both bidders have positive expected profits. Journal of Economic Literature Classification Number: C7.     

English auctions and the Stolper-Samuelson theorem

We prove that the English auction (with bidders that need not be ex ante identical and may have interdependent valuations) has an efficient ex post equilibrium. We establish this result for environments where it has not been previously obtained. We also prove two versions of the Stolper-Samuelson theorem, one for economies with n goods and n factors, and one for non-square economies. Similar assumptions and methods underlie these seemingly unrelated results.     

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.     

Competitive auctions

We study a class of single-round, sealed-bid auctions for an item in unlimited supply, such as a digital good. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e. encourages bidders to bid their true valuations) and on all inputs yields profit that is within a constant factor of the profit of the optimal single sale price. We justify the use of optimal single price profit as a benchmark for evaluating a competitive auctions profit. We exhibit several randomized competitive auctions and show that there is no symmetric deterministic competitive auction. Our results extend to bounded supply markets, for which we also give competitive auctions.     

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.     

Budget-constrained sequential auctions with incomplete information

I study a budget-constrained, private-valuation, sealed-bid sequential auction with two incompletely-informed, risk-neutral bidders in which the valuations and income may be non-monotonic functions of a bidder's type. Multiple equilibrium symmetric bidding functions may exist that differ in allocation, efficiency and revenue. The sequence of sale affects the competition for a good and therefore also affects revenue and the prices of each good in a systematic way that depends on the relationship among the valuations and incomes of bidders. The sequence of sale may affect prices and revenue even when the number of bidders is large relative to the number of goods. If a particular good, say α, is allocated to a strong bidder independent of the sequence of sale, then auction revenue and the price of good α are higher when good α is sold first.     

Learning to bid: The design of auctions under uncertainty and adaptation

We examine auction design in a context where symmetrically informed adaptive agents with common valuations learn to bid for a good. Despite the absence of private valuations, asymmetric information, or risk aversion, bidder strategies do not converge to the Bertrand–Nash equilibrium strategies even in the long run. Deviations from equilibrium strategies depend on uncertainty regarding the value of the good, auction structure, the agents? learning model, and the number of bidders. Although individual agents learn Nash bidding strategies in isolation, the learning of each agent, by flattening the best-reply correspondence of other agents, blocks common learning. These negative externalities are more severe in second-price auctions, auctions with many bidders, and auctions where the good has an uncertain value ex post.