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.     

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.     

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.     

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.     

Beyond chopsticks: Symmetric equilibria in majority auction games

Majority auction games are simultaneous sealed-bid auctions of identical objects among identical bidders who each want to win a specified fraction (more than a half) of the objects. Each bidder receives no benefit from winning less than the specified fraction and no additional benefit from winning more than it. Symmetric equilibria having simple, intuitive forms are shown to exist in first-price, second-price and all-pay versions of such games when the number of bidders is sufficiently large. This contrasts with earlier results for the two-bidder “pure chopstick” majority auction games where the only known equilibria are more complicated.     

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.     

Standard Auctions with Financially Constrained Bidders

We develop a methodology for analyzing the revenue and efficiency performance of auctions when buyers have private information about their willingness to pay and ability to pay. We then apply the framework to scenarios involving standard auction mechanisms. In the simplest case, where bidders face absolute spending limits, first-price auctions yield higher expected revenue and social surplus than second-price auctions. The revenue dominance of first-price auctions over second-price auctions carries over to the case where bidders have access to credit. These rankings are explained by differences in the extent to which financial constraints bind in different auction formats.     

Bidding in a possibly common-value auction

We analyze a second-price auction with two bidders in which only one of the bidders is informed as to whether the object is valued commonly. We show that any equilibrium strategy of the bidder who is uninformed must be part of an equilibrium when both bidders instead know that the auction is not common value, regardless of the way in which the values are different. We derive sufficient conditions for equilibrium existence.     

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.     

Bidding behavior in asymmetric auctions: An experimental study

We review an asymmetric auction experiment. Based on Plum (Int. J. Game Theory 20 (1992) 393) private valuations of the two bidders are independently drawn from distinct but commonly known distributions, one of which first-order stochastically dominates the other. We test the qualitative properties of that model of asymmetric auctions, in particular whether the weak bidder behaves more aggressively than the strong, and then test bidders’ preference for first- vs. second-price auctions.     

Regret in auctions: theory and evidence

The sealed-bid first-price auction of a single object in the case of independent privately-known values is the simplest auction setting and understanding it is important for understanding more complex mechanisms. But bidders bid above the risk-neutral Nash equilibrium theory prediction. The reasons for this “over bidding” remain an unsolved puzzle. Several explanations have been offered, including risk aversion, social comparisons, and learning. We present a new explanation based on regret and a model that explains not only the observed over bidding in sealed-bid first-price auctions, but also behavior in several other settings that is inconsistent with risk aversion. The authors gratefully acknowledge support from the National Science Foundation.     

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.     

Determining damages from the operation of bidding rings: An analysis of the post-auction `knockout' sale

Summary. This paper studies ‘knockout’ auctions, typically organized by bidding rings, in which the winning bidder makes side-payments to all losing bidders. These side-payments provide an incentive for the ring members to bid higher than they would have in an identical public auction. As a consequence, neither the realized price nor the total payments of the winner are unbiased estimates of the item's price in the absence of collusion. This paper evaluates the extent of this overestimate in the independent private values case, for first and second price post-auction knockouts. Bids are not independent of the sharing rule but transfers from the winning bidder are. Further, bidder payoffs are independent of both the auction format and the sharing rule. The “overbidding” in the knockout is increasing with the dispersion of bidder valuations and of significant empirical relevance. This paper's results can be used to obtain an unbiased assessment of the damages inflicted on the seller. Received: May 1, 1996; revised version: September 7, 2000     

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.     

Finding and retaining the dominant strategy: The second-price, English and ‘sealed offer’ English auctions

Using experiments in a procurement setting, this study examined the performance abilities of three auctions: the second-price, English, and a new ‘sealed offer’ English. Additionally, to see if dominant strategy learning would be transferred, after fifteen periods with one of the three auctions, all subjects completed a second 15 periods with the second-price auction. The English auction performed best overall. However, only limited learning was found to occur, with some subjects that had adopted the dominant strategy in the English switching in the second-price. Lessons from the new mechanism transferred better, but initial learning of the dominant strategy was slower.     

Multiple unit auctions with strategic price-quantity decisions

Summary. I study a multiple unit auction where symmetric risk-neutral bidders choose prices and quantities endogenously. In the model, bidders (a) may place non-linear valuations on the auctioned units, and (b) bid for several units at the same price (“lumpy” bids). I characterize quantity-symmetric and strictly monotone-increasing price equilibria for discriminatory and competitive auctions, and show that (i) if quantity strategy profiles are equal across auctions revenue- equivalence holds, (ii) expected revenue is higher if bidders bid for the entire supply rather than for shares of it, and (iii) equilibrium allocations may fail to be Pareto-optimal. Received: April 14, 1995; revised version: September 3, 1997     

A non-expected utility model and its application in practical auctions

ABSTRACT

This article presents a non-expected utility decision model which is nonlinear in the winning probabilities. The model not only explicitly expresses bidders’ attitudes to risk, but also addresses their preference over the bidding criteria. To demonstrate how to apply the model in the practical auction design, the first- and second-price auctions with both commission rate and reserve price are examined, respectively. For nonrisk-neutral bidders, the equilibrium bidding strategies are characterized, in which the commission rate has a significant influence on the bidding strategy through the critical valuation. However, the existence of the optimal commission rate is uncertain, but once it exists, it depends on the information rent of the highest or second highest order valuation in terms of the inverse hazard rate. With risk-aversion bidders, the only difference to the optimal reserve price is a constant between the first- and second-price auctions. The revenue comparisons show that the classical Revenue Equivalence Theorem fails in practical auctions with the commission rate. This article extends the application of the decision-making model in the auction design in theory and provides some guidance for the auction house and the seller to make their decisions in reality.     

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.     

Non-bidding equilibrium in an ascending core-selecting auction

This paper investigates the perfect Bayesian equilibrium in an ascending-price core-selecting auction, which is recently used in some countries? spectrum license auctions. We suppose that there are two identical items, two small bidders, and one large bidder. The small bidders demand only one unit of the item, whereas the large bidder wants both units. Package bidding ensures that the large bidder faces no exposure problem and behaves truthfully. However, one of the small bidders stops bidding at the beginning in the equilibrium. Although small bidders generally face the free-rider problem and have incentives to underbid, once a bidder is the only small one remaining, he bids truthfully. Stopping early induces the remaining bidder to behave truthfully. Hence, each small bidder wants to be the first to stop bidding. The free-rider problem is considerably mitigated when there are many small bidders.