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.     

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.     

Nonparametric panel estimation of online auction price processes

In this study, we examine the price process of eBay online auctions. We pool sparse and unevenly spaced bidding histories of individual auctions, resulting in an unbalanced panel of bids. Since the price processes of online auctions are monotonically increasing within individual auctions and exhibit a substantial degree of heterogeneity, we propose a monotone series estimator for panel data with auction-specific slopes for a common relative price growth curve. We generalize Ramsay’s (1998, J R Stat Soc B 60(2):365–375) monotone series estimator to fit our panel model of the price process. We apply the proposed model and estimator to eBay auctions of a popular hand-held device (a Palm PDA). The results are shown to capture closely the overall pattern of observed price dynamics. In particular, the early bidding, mid-auction bidding drought, and end-auction bid sniping are well approximated by the estimated price curve.     

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.     

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.     

Optimal search auctions

We study the design of profit maximizing single unit auctions under the assumption that the seller needs to incur costs to contact prospective bidders and inform them about the auction. With independent bidders’ types and possibly interdependent valuations, the seller's problem can be reduced to a search problem in which the surplus is measured in terms of virtual utilities minus search costs. Compared to the socially efficient mechanism, the optimal mechanism features fewer participants, longer search conditional on the same set of participants, and inefficient sequence of entry.     

Indicative bidding and a theory of two-stage auctions

Motivated by the practice of indicative bidding, which is commonly used in sales of complex and valuable assets, this paper develops a theory of two-stage auctions based on the assumption that learning valuation is costly. In various cases that characterize what can be learned in the due diligence stage, we show that no symmetric increasing equilibrium exists and hence efficient entry cannot be guaranteed under the current design of indicative bidding. However, by introducing auctions of entry rights with binding first-round bids, we show that efficient entry can be induced under certain conditions. We also show that optimal auctions are typically characterized by a limited number of final bidders, which justifies the general practice of conducting two-stage auctions in environments with costly entry.     

Seller competition by mechanism design

This paper analyzes a market game in which sellers offer trading mechanisms to buyers and buyers decide which seller to go to depending on the trading mechanisms offered. In a (subgame perfect) equilibrium of this market, sellers hold auctions with an efficient reserve price but charge an entry fee. The entry fee depends on the number of buyers and sellers, the distribution of buyer valuations, and the buyer cost of entering the market. As the size of the market increases, the entry fee decreases and converges to zero in the limit. We study how the surplus of buyers and sellers depends on the number of agents on each side of the market in this decentralized trading environment.     

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.     

BIDDING TO GIVE: AN EXPERIMENTAL COMPARISON OF AUCTIONS FOR CHARITY*

We experimentally compare three mechanisms used to raise money for charities: first‐price winner‐pay auctions, first‐price all‐pay auctions, and lotteries. We stay close to the characteristics of most charity auctions by using an environment with incomplete information and independent private values. Our results support theoretical predictions by showing that the all‐pay format raises substantially higher revenue than the other mechanisms.     

A comparison of first price multi-object auctions

We compare simultaneous multi-object English-type ascending price auctions with first price sealed bid auctions in private values environments with multi-object demands. Special attention is paid to the effect of closing rules on ascending auctions’ outcomes. We find that simultaneous ascending auctions with the soft closing rule are the most efficient, while the sealed bid auctions generate the highest revenue. Ascending auctions with the hard closing rule display a significant amount of late bidding, resulting in the lowest among the three institutions revenue and efficiency.

---

Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.      

Endogenous Entry and Exit in Common Value Auctions

We develop and experimentally test a model of endogenous entry, exit, and bidding in common value auctions. The model and experimental design include an alternative profitable activity (a safe haven) that provides agentspecific opportunity costs of bidding in the auction. Each agent chooses whether to accept the safe haven income or forgo it in order to bid in the auction. Agents that enter the auction receive independently-drawn private signals that provide unbiased estimates of the common value. The auctioned item is allocated to the high bidder at a price that is equal to the high bid. Thus the market is a first-price sealed-bid common value auction with endogenous determination of market size.     

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.     

Ascending price Vickrey auctions for general valuations

Ascending price auctions involving a single price path and buyers paying their final bid price cannot achieve the Vickrey-Clarke-Groves (VCG) outcome in the combinatorial auctions setting. Using a notion called universal competitive equilibrium prices, shown to be necessary and sufficient to achieve the VCG outcome using ascending price auctions, we define a class of ascending price auctions in which buyers bid on a single price path. Truthful bidding by buyers is an ex post Nash equilibrium in such auctions. By giving discounts to buyers from the final price, the VCG outcome is achieved for general valuations.     

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     

Sequential auctions with imperfect quantity commitment

This paper studies sequential second price auctions with imperfect quantity commitment in environments involving single-unit demands, independent private values, and non-decreasing marginal costs. The paper characterizes the symmetric equilibrium strategy and demonstrates that the equilibrium price sequence is conditionally non-increasing, showing a downwards drift in cases in which the marginal cost exceeds the reserve price with positive probability. The paper also argues that unlike a strong seller who sets reserve prices strictly above marginal costs, a weak seller will typically prefer to commit to such inefficiently low reserve prices.     

Internet auctions with many traders

We study a multi-unit auction environment similar to eBay. Sellers, each with a single unit of a homogeneous good, set reserve prices at their own second-price auctions. Each buyer has private value for the good and wishes to acquire a single unit. Buyers can bid as often as they like and move between auctions. We characterize a perfect Bayesian equilibrium for this decentralized dynamic mechanism in which, conditional on reserve prices, an efficient set of trades occurs at a uniform price. In a large but finite market, the sellers set reserve prices equal to their true costs under a very mild distributional assumption, so ex post efficiency is achieved. Buyers’ strategies in this equilibrium are simple and do not depend on their beliefs about other buyers’ valuations, or the number of buyers and sellers.     

Using Random nth Price Auctions to Value Non-Market Goods and Services

Public policy decision making often requires balancing the benefits of a policy with the costs. While regulators in the United States and abroad rely heavily on benefit-cost analysis, critics contend that hypothetical bias precludes one of the most popular benefit estimation techniques—contingent surveys—from providing reliable economic values for nonmarket goods and services. This paper explores a new methodology to obtain the total value of nonmarket goods and services—random nth price auctions. The empirical work revolves around examining behavior of 360 participants in a competitive marketplace, where subjects naturally buy, sell, and trade commodities. The field experiment provides some preliminary evidence that hypothetical random nth price auctions can, in certain situations, reveal demand truthfully.     

ENTRY REGULATIONS,WELFARE, AND DETERMINANTS OF MARKET STRUCTURE

Welfare effects of entry regulations are theoretically ambiguous in differentiated product markets. We use a dynamic oligopoly model of entry and exit with store‐type differentiation and static price setting to evaluate how entry regulations affect long‐run profitability, market structure, and welfare. Based on unique data for all retail food stores in Sweden, we estimate demand, recover variable profits, and estimate entry costs and fixed costs by store type. Counterfactual policy experiments show that welfare increases when competition is enhanced by lower entry costs. Protecting small stores by imposing licensing fees on large stores is not welfare enhancing.     

Sequential versus Bundle Auctions for Recurring Procurement

We compare sequential and bundle procurement auctions in a framework of successive procurement situations, where current success positively or negatively affects future market opportunities. We find that in bundle auctions procurement cost is lower and less risky than in sequential standard auctions, but still higher than in the optimal sequential auction. Only a sequential second price auction leads to the efficient outcome.