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.     

The role of varying risk attitudes in an auction with a buyout option

Summary. An auction with a buyout option is modelled. Such an option allows a bidder to purchase the item being auctioned at a pre-specified buyout price, instead of attempting to obtain the item through the traditional auction procedure. This analysis is motivated by internet auctions where such options are present. If all auction participants are risk neutral, the seller will choose a buyout price high enough so that the option is never exercised. However, a risk averse seller facing risk neutral bidders will choose a price low enough so that the option is exercised with positive probability. Further, if bidders are risk neutral and the seller is risk averse, this option may result in a Pareto improvement compared to a sealed bid second price auction.Received: 3 December 2002, Revised: 28 September 2004, JEL Classification Numbers: D44, L86, D8. Correspondence to: Timothy MathewsWe would like to thank Yair Tauman, Thomas Jeitschko, Pradeep Dubey, Konstantinos Serfes, Abraham Neyman, Qihong Liu, and an anonymous referee, as well as participants of the 2001 Canadian Economic Association Conference and the 2001 Stony Brook International Conference on Game Theory. This paper is based upon Chapter Two of Mathews doctoral dissertation.     

Survival auctions

Dynamic clock auctions with drop-out information typically yield outcomes closer to equilibrium predictions than do comparable sealed-bid auctions. However, clock auctions require congregating bidders for a fixed time interval, which has limited field applicability and introduces inefficiencies of its own given the time cost of congregating bidders. In this experiment we explore the effects of removing these inefficiencies through survival auctions—a multi-round sealed-bid auction which is theoretically isomorphic to the dynamic clock auction with drop-out information. Kagel’s research was partially supported by National Science Foundation Grants No. 0136925 and 0136928. Any opinions, findings, and conclusions or recommendations in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. We thank the associate editor, an anonymous referee, seminar participants at Purdue University, especially Tim Cason, participants at International Industrial Organization April 2004 Conference, the ESA June 2003 meetings, and our discussant, Tim Salmon, for valuable comments. Kirill Chernomaz provided valuable research assistance. The usual caveat applies.     

Auctions with endogenous participation and an uncertain number of bidders: experimental evidence

Attracting bidders to an auction is a key factor in determining revenue. We experimentally investigate entry and bidding behavior in first-price and English clock auctions to determine the revenue implications of entry. Potential bidders observe their value and then decide whether or not to incur a cost to enter. We also vary whether or not bidders are informed regarding the number of entrants prior to placing their bids. Revenue equivalence is predicted in all four environments. We find that, regardless of whether or not bidders are informed, first-price auctions generate more revenue than English clock auctions. Within a given auction format, the effect of informing bidders differs. In first-price auctions, revenue is higher when bidders are informed, while the opposite is true in English clock auctions. The optimal choice for an auction designer who wishes to maximize revenue is a first-price auction with uninformed bidders.     

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.     

Revealing information in auctions: the allocation effect

When there are two bidders, releasing independent information in an English auction with private values makes the seller worse off. However, this is no longer true with more bidders: when there is enough competition, revelation benefits the auctioneer. In three examples the dividing case is shown to be three bidders. This allocation effect applies to other standard auctions and parallels the bundling decision in a multi-unit auction. I would like to thank Jeremy Bulow, Willie Fuchs, Paul Klemperer, Rob McMillan, Phil Reny, Jeff Zwiebel and especially Andy Skrzypacz. I also grateful to two referees and an Associate Editor for a number of helpful comments.     

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 asymmetric financial externalities

This paper studies optimal auction design with asymmetric linear financial externalities among bidders. When the matrix Γ that relates bidders? payoffs to their payments is nonsingular, the payment-related component in the design objective must equal a unique linear combination of its counterparts in bidder?s payoffs. If all multipliers of the linear combination are nonnegative, a modified Myerson procedure is discovered for deriving the optimal design. If any multiplier is negative, an arbitrarily high value can be achieved for design objective by setting proper fixed transfers to bidders. When the matrix Γ is singular, the unbounded optimum result typically prevails. We applied our method to auctions with cross shareholdings and charity auctions for revenue-maximizing and efficient designs.     

Risky procurement with an insider bidder

Procurement auctions carry substantial risk when the value of the project is highly uncertain and known only to insiders. This paper reports the results from a series of experiments comparing the performance of three auction formats in such complex and risky settings. In the experiment, every bidder knows the private value for the project but only a single insider bidder knows the common-value part. In addition to the standard second-price and English auctions we test the “qualifying auction,” a two-stage format commonly used in the sale of complex and risky assets. The qualifying auction has a fully “revealing” equilibrium that implements the revenue-maximizing outcome but it also has an uninformative “babbling” equilibrium in which bidders place arbitrarily high bids in the first stage. In the experiments, the latter equilibrium has more drawing power, which causes the qualifying auction to perform worse than the English auction and only slightly better than a sealed-bid second-price auction. Compared to the two other formats, the English auction is roughly 40% more efficient, yields 50% more revenues, avoids windfall profits for the insider, while protecting uninformed bidders from losses.     

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.     

A STUDY OF PARTICIPATION IN DYNAMIC AUCTIONS

This article studies repeated entry and bidding decisions in construction procurement auctions. I find evidence in the data that suggests the presence of significant cost savings from entering contracts of the same type. I estimate a dynamic auction model to measure the gains to experience for bidders. I allow for endogenous entry, synergies in entry, and unobserved auction heterogeneity. I find that a bidder can halve entry costs by focusing on specific contract types. An auctioneer can increase competition by awarding contracts of the same type in sequence. As a result, procurement costs for each contract can be lowered by 7%, a saving of $110,000.     

Charitable asymmetric bidders

Recent papers show that the all‐pay auction is better at raising money for charity than the first‐price auction with symmetric bidders under incomplete information. Yet, this result is lost with sufficiently asymmetric bidders under complete information. In this paper, we consider a framework on charity auctions with asymmetric bidders under some incomplete information. We find that the all‐pay auction still raises more money than the first‐price auction. Thus, the all‐pay auction should be seriously considered when one wants to organize a charity auction.     

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     

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.     

Simultaneous use of auctions and posted prices

I consider a model in which several identical objects are sold simultaneously via an auction and a posted price mechanism. The model explains several empirical regularities regarding bidding behavior in eBay auctions such as the finding that some bidders bid multiple times over the course of the auction, and that bidders tend to bid with greater frequency near the end of the auction than the beginning. I also show that sellers prefer to simultaneously use auctions and posted prices than to use either mechanism individually.     

An optimal slow Dutch auction

We study slow Dutch auctions, where the clock does not fall instantaneously, but instead falls over time. Buyers are assumed less patient than the seller. In a symmetric setting, we investigate the properties of the optimal revenue-maximizing clock. We find that the clock is genuinely dynamic and the auction involves delays.     

Endogenous entry and self-selection in private value auctions: An experimental study

This paper presents the results of an experimental study of endogenous entry in first-price independent private value auctions. N potential bidders simultaneously decide whether to participate in an auction or receive a known outside option. In the second stage, entrants submit bids after learning their own private values and the number of entrants. An equilibrium model of heterogeneous risk averse bidders implies a self-selection effect, where bidding in the auction is lower with endogenous entry because only less risk averse bidders enter. This effect is confirmed by the experiment. We also observe excessive entry relative to the theoretical model.     

Competition among auctioneers in large markets

We analyse a multistage game of competition among auctioneers. First, the auctioneers commit to some reserve prices; second, the bidders enter one auction, if any; and finally, the auctions take place. We show that for any finite set of feasible reserve prices, each auctioneer announces a reserve price equal to his production cost if the numbers of auctioneers and bidders are sufficiently large, though finite. Our result supports the idea that optimal auctions may be quite simple. Our model also confirms previous results for some “limit” versions of the model by McAfee (Econometrica 61 (1993) 1281-1312), Peters (Rev. Econ. Stud. 64 (1997) 97-123), and Peters and Severinov (J. Econ. Theory 75 (1997) 141-179).     

The multiple unit auction with variable supply

Summary. The theory of multiple unit auctions traditionally assumes that the offered quantity is fixed. I argue that this assumption is not appropriate for many applications because the seller may be able and willing to adjust the supply as a function of the bidding. In this paper I address this shortcoming by analyzing a multi-unit auction game between a monopolistic seller who can produce arbitrary quantities at constant unit cost, and oligopolistic bidders. I establish the existence of a subgame-perfect equilibrium for price discriminating and for uniform price auctions. I also show that bidders have an incentive to misreport their true demand in both auction formats, but they do that in different ways and for different reasons. Furthermore, both auction formats are inefficient, but there is no unambiguous ordering among them. Finally, the more competitive the bidders are, the more likely the seller is to prefer uniform pricing over price discrimination, yet increased competition among bidders may or may not enhance efficiency. Received: June 18, 1998; revised version: January 13, 1999     

Mixed bundling auctions

We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which partitions are chosen in the mechanism. This class contains efficient auctions, pure bundling auctions, mixed bundling auctions, auctions with reserve prices and auctions with pre-packaged bundles. For any number of objects and bidders, both the pure bundling auction and separate, efficient auctions for the single objects are revenue-inferior to an auction that involves mixed bundling.