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.     

Strategic ignorance in a second-price auction

Suppose that bidders may publicly choose not to learn their values prior to a second-price auction with costly bidding. All equilibria with truthful bidding exhibit bidder ignorance when the number of bidders is sufficiently small. Ignorance considerations also affect the optimal reserve price.     

CHARITY AUCTIONS*

In a charity auction the public‐goods nature of auction revenue affects bidding incentives. We compare equilibrium bidding and revenue in first‐price, second‐price, and all‐pay charity auctions. Bidding revenue typically varies by selling format. First‐price auctions are less lucrative than second‐price and all‐pay auctions, and with sufficiently many bidders the all‐pay auction has the highest bidding revenue. However, revenue equivalence applies when the auctioneer can set a reserve price and fees plus threaten to cancel the auction. If the auctioneer cannot threaten cancellation, a reserve and bidding fee can augment revenue but again revenue varies by auction format     

Strategic Jump Bidding in English Auctions

This paper solves for equilibria of sequential bid (or English) auctions with affiliated values when jump bidding strategies may be employed to intimidate one's opponents. In these equilibria, jump bids serve as correlating devices which select asymmetric bidding functions to be played subsequently. Each possibility of jump bidding provides a Pareto improvement for the bidders from the symmetric equilibrium of a sealed bid, second-price auction. The expanded set of equilibria can approximate either first- or second-price outcomes and produce exactly the set of expected prices between those two bounds. These results contrast with standard conclusions that equate English and second-price auctions.     

Asymmetric information about rivals'' types in standard auctions

We study auctions in which bidders may know the types of some rival bidders but not others. This asymmetry in bidders' knowledge about rivals' types has different effects on the two standard auction formats. In a second-price auction, it is weakly dominant to bid one's valuation, so the knowledge of rivals' types has no effect, and the good is allocated efficiently. In a first-price auction, bidders refine their bidding strategies based on their knowledge of rivals' types, which yields an inefficient allocation. We show that the inefficient allocation in the first-price auction translates into a poor revenue performance. Given a standard regularity condition, the seller earns higher expected revenue from the second-price auction than from the first-price auction, whereas the bidders are better off from the latter.     

First-price auctions with resale: the case of many bidders

We study first-price auctions with resale when there are many bidders and derive existence and characterization results under the assumption that the winner of the initial auction runs a second-price auction with an optimal reserve price. The fact that symmetrization fails when there are more than two bidders has been observed before, but we also provide the direction: weaker bidders are less likely to win than stronger ones. For a special class of distributions and three bidders, we prove that the bid distributions are more symmetric with resale than without. Numerical simulations suggest that the more bidders there are, the more similar the allocation is to the case without resale, and thus, the more asymmetric the bid distributions are between strong and weak bidders. We also show in an example that the revenue advantage of first-price auctions over second-price auctions is positive, but decreasing in the number of bidders.     

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 experiment on auctions with endogenous budget constraints

We perform laboratory experiments comparing auctions with endogenous budget constraints. A principal imposes a budget limit on a bidder (an agent) in response to a principal-agent problem. In contrast to the existing literature where budget constraints are exogenous, this theory predicts that tighter constraints will be imposed in first-price auctions than in second-price auctions, tending to offset any advantages attributable to the lower bidding strategy of the first-price auction. Our experimental findings support this theory: principals are found to set significantly lower budgets in first-price auctions. The result holds robustly, whether the principal chooses a budget for human bidders or computerized bidders. We further show that the empirical revenue difference between first- and second-price formats persists with and without budget constraints.     

Risk aversion and optimal reserve prices in first- and second-price auctions

We analyze the effects of buyer and seller risk aversion in first- and second-price auctions in the classic setting of symmetric and independent private values. We show that the seller's optimal reserve price decreases in his own risk aversion, and more so in the first-price auction. The reserve price also decreases in the buyers' risk aversion in the first-price auction. Thus, greater risk aversion increases ex post efficiency in both auctions - especially that of the first-price auction. At the interim stage, the first-price auction is preferred by all buyer types in a lower interval, as well as by the seller.     

Large common value auctions with risk averse bidders

We analyze large symmetric auctions with conditionally i.i.d. common values and risk averse bidders. Our main result characterizes the asymptotic equilibrium price distribution for the first- and second-price auctions. As an implication, we show that with constant absolute risk aversion (CARA), the second-price auction raises significantly more revenue than the first-price auction. While this ranking seems robust in numerical analysis also outside the CARA specification, we show by counterexamples that the result does not generalize to all risk averse utility functions.     

Almost common values auctions revisited

In almost common-value auctions one bidder (the advantaged bidder) has a valuation advantage over all other (regular) bidders. It is well known that in second-price auctions with two bidders, even a slight private-value advantage can have an explosive effect on auction outcomes as the advantaged bidder wins all the time and auction revenue is substantially lower than in a pure second-price common-value auction. We explore the robustness of these results to the addition of more regular bidders in second-price auctions, and the extent to which these results generalize to ascending-price English auctions in an effort to provide insight into when and why one ought to be concerned about such slight asymmetries.     

Multi-dimensional reference-dependent preferences in sealed-bid auctions – How (most) laboratory experiments differ from the field

We study bidding behavior in first- and second-price sealed-bid auctions with loss-averse agents. Our model predicts overbidding in first-price induced-value auctions consistent with evidence from most laboratory experiments. Substantially different bidding behavior could result in commodity auctions where money and auction item are consumed along different dimensions of the consumption space. Differences also result in second-price auctions. Our study thereby indicates that transferring qualitative behavioral findings from induced-value laboratory experiments to the field may be problematic if subjects are loss-averse.     

A common value auction model with endogenous entry and information acquisition

Summary Much of the auction literature assumes both a fixed number of bidders and a fixed information setting. This sidesteps the important and often costly decisions a potential bidder must make prior to an auction: Should I enter and, if I do, what level of resources should I expend evaluating the good prior to bidding? We answer these questions for a stylized information model of a common value auction. The expected selling price is shown to be the expected value of the good minus the expected aggregate entry and information costs of the bidders. Thus, the seller indirectly pays for these costs to the bidders. There are auctions where the seller seemingly restricts the bidders' information expenditures. While this restriction does influence the entry decision, we demonstrate that the overall effect can be to improve the selling price. Finally, the probability of entry and the chosen accuracy of the information are never more in the second-price auction than in the first-price auction, and the seller prefers the second-price auction.We are grateful for the comments and suggestions of seminar participants at the University of British Columbia, Dartmouth College, the University of Wisconsin, Yale University, and the International Conference on Game Theory and Economics at SUNY Stony Brook.     

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.     

Laboratory Testbeds and Non-Market Valuation: The Case of Bidding Behavior in a Second-Price Auction with an Outside Option

Researchers now use the lab to examine the behavioral underpinnings of valuation before the field application which some argue has less experimental control. But lab valuation work raises its own set of concerns when it uses private goods to explore non-market valuation behavior because private goods have substitutes often unaccounted for in the lab. Therefore, the lab as a tool to testbed field valuation work may be limited. Herein we design an induced valuation experiment to explore bidding behavior in a second-price auction with an outside option that is a perfect substitute for the auction commodity. Theory predicts that rational bidders will consider the prices of outside options when formulating bidding strategies, and will reduce their bids whenever their resale value exceeds the price of the outside option. Our results suggest that bidders account for outside options when formulating bids with behavior following comparative static predictions. In addition, we provide evidence concerning hypothetical versus actual behavior with induced values – the data suggesting a hypothetical bias in the level of bids but not in bid shaving.     

Sequentially Optimal Auctions

In auctions where a seller can post a reserve price but if the object fails to sell cannot commit never to attempt to resell it, revenue equivalence between repeated first price and second price auctions without commitment results. When the time between auctions goes to zero, seller expected revenues converge to those of a static auction with no reserve price. With many bidders, the seller equilibrium reserve price approaches the reserve price in an optimal static auction. An auction in which the simple equilibrium reserve price policy of the seller mirrors a policy commonly used by many auctioneers is computed.Journal of Economic LiteratureClassification Numbers: C78, D44, D82.     

Bidding for the future: signaling in auctions with an aftermarket

This paper considers auctions where bidders compete for an advantage in future strategic interactions. When bidders wish to exaggerate their private information, equilibrium bidding functions are biased upwards as bidders attempt to signal via the winning bid. Signaling is most prominent in second-price auctions where equilibrium bids are “above value.” In English and first-price auctions, signaling is less extreme since the winner incurs the cost of her signaling choice. The opportunity to signal lowers bidders’ payoffs and raises revenue. When bidders understate their private information, separating equilibria need not exist and the auction may not be efficient.     

Auctions with Financial Externalities

We study auctions with financial externalities, i.e., auctions in which losers care about how much the winner pays. In the first-price auction, larger financial externalities result in a lower expected price; in the second-price auction, the effect is ambiguous. Although the expected price in the second-price auction may increase if financial externalities increase, the seller is not able to gain more revenue by guaranteeing the losers a fraction of the auction revenue. With a reserve price, we find that both auctions may have pooling at the reserve price. This finding suggests that identical bids need not be a signal of collusion, in contrast to what is sometimes argued in anti-trust cases. We gratefully acknowledge financial support from the Dutch National Science Foundation (NWO 510.010.501 and NWO-VICI 453.03.606). For valuable discussions and comments, we would like to thank Eric van Damme, Jacob Goeree, Thomas Kittsteiner, Marta Kolodziejczyk, seminar participants at Tilburg University, Humboldt University Berlin, and National University of Singapore, and audiences at ESEM 2001 in Lausanne, and the FEEM 2002 conference in Milan on auctions and market design. The suggestions of an anonymous referee of this Journal greatly improved the article. The usual disclaimer applies.     

REPUTATIONAL BIDDING

We consider auctions where bidders care about the reputational effects of their bidding and argue that the amount of information disclosed at the end of the auction will influence bidding. We focus on bid disclosure rules that capture all of the realistic cases. We show that bidders distort their bidding in a way that conforms to stylized facts about takeovers/licence auctions. We rank the disclosure rules in terms of their expected revenues and find that, under certain conditions, full disclosure will not be optimal. First‐price and second‐price auctions with price disclosure are not revenue equivalent and we rank them.     

Efficient collusion in repeated auctions with communication

This paper studies collusion in repeated auctions when bidders communicate prior to each stage auction. For independent and correlated private signals and general interdependent values, the paper identifies conditions under which an equilibrium collusion scheme is fully efficient in the sense that the bidders’ payoff is close to what they get when the object is allocated to the highest valuation bidder at the reserve price in every period.