Secret reserve prices in first-price auctions

This article offers a theoretical explanation for the use of secret reserve prices in auctions. I study first-price auctions with and without secret reserve price in an independent private values environment with risk-neutral buyers and a seller who cares at least minimally about risk. The seller can fix the auction rules either before or after she learns her reservation value. Fixing the rules early and keeping the right to set a secret reserve price can be strictly optimal. Moreover, I describe the relation of using a secret reserve price to phantom bidding and non-commitment to sell.     

Cartel stability in experimental first-price sealed-bid and English auctions

Using laboratory experiments, we compare the stability of bidding rings in the first-price sealed-bid auction and the English auction in a heterogeneous-value setting. In both a re-matching condition and a fixed-matching condition, we observe that bidding rings are more stable in the English auction than in the first-price sealed-bid auction. In both conditions, the first-price sealed-bid auction dominates the English auction in terms of average revenue and the revenue spread. The English auction outperforms the first-price sealed-bid auction in terms of efficiency.     

Optimal strategy of multi-product retailers with relative thinking and reference prices

Experimental evidence suggests that consumers are affected by reference prices and by relative price differences (“relative thinking”). A linear-city model of two retailers that sell two goods suggests how this consumer behavior affects firm strategy and market outcomes. A simple model analyzes the case in which all consumers want to buy both goods. An extended version adds consumers who want only one good. Relative thinking leads firms to increase the markup on the good with the higher reference price and decrease the markup on the other good, possibly to a negative markup. Stronger relative thinking increases the firms' profits.     

Optimal sequential auctions

Sequential sealed first-price and open descending-price procurement auctions are studied. We examine which procurement auction rule achieves the low procurement cost. We show that the answer to this policy question depends on whether the items are complements or substitutes. With substitutes, the first-price procurement auction is preferred, while with complements, the open descending-price procurement auction is preferred. We also illustrate the procurement cost minimizing auction and the auction rule preferred by the bidders. With substitutes, bidders prefer the open descending-price procurement auction, while with complements bidders prefer the first-price procurement auction.     

Comparing predicted prices in auctions for online advertising

Online publishers sell opportunities to show ads. Some advertisers pay only if their ad elicits a user response. Publishers estimate response rates for ads in order to estimate expected revenues from showing the ads. Then publishers select ads that maximize estimated expected revenue.By taking a maximum among estimates, publishers inadvertently select ads based on a combination of actual expected revenue and inaccurate estimation of expected revenue. Publishers can increase actual expected revenue by selecting ads to maximize a combination of estimated expected revenue and estimation accuracy.     

Optimal bid disclosure in patent license auctions under alternative modes of competition

The literature on patent license auctions in oligopoly assumed that the auctioneer reveals the winning bid and stressed that this gives firms an incentive to bid high in order to signal an aggressive output strategy in a downstream Cournot market game, and conversely bid low to signal acquiescent pricing in a Bertrand market game. The present paper examines the information revealed by publishing the winning or the losing or no bid, assuming an oligopoly with differentiated goods. We rank disclosure rules and find that it is not optimal for the innovator to disclose the winning bid, regardless of the mode of competition.     

Optimal choice of a reserve price under uncertainty

The revenue function for a standard auction is typically asymmetric around the revenue maximizing reserve price. Thus, choosing a reserve price that is smaller than the revenue maximizing reserve price can result in a substantially different loss than choosing one that is larger by the same amount. Therefore, when the revenue function is unknown, it is important to consider uncertainty around the revenue function and its asymmetric structure. For this purpose, I propose a Bayesian decision rule and illustrate its typical revenue gains. I then apply the rule to the bid data from the U.S. timber sales.     

Position auctions with dynamic resizing

This paper analyzes mechanisms for selling advertising inventory in a position auction in which displaying less than the maximal number of ads means the ads that are shown can be dynamically resized and displayed more prominently. I characterize the optimal mechanism with and without dynamic resizing, and illustrate how the optimal reserve prices in a Vickrey–Clarke–Groves mechanism vary with the amount of dynamic resizing and the number of bidders.     

Procurement auctions with entry of bidders

In procurement auctions with a fixed number of bidders there is a tradeoff between cost efficiency and rent extraction. An optimal mechanism, therefore, entails distortions of effort (Laffont and Tirole, 1987). If potential suppliers must sink an entry investment before they can participate in the auction, then decreasing the firms' rent may imply reduced entry. We show that if potential bidders are uninformed before entry, commitment to a plain, nondistortive auction is optimal. In contrast, if potential bidders learn all their private information before entry, the optimal mechanism entails the same distortions as in Laffont and Tirole's static model.     

Analysis of spectrum auctions in India—An application of the opportunity cost approach to explain large variations in spectrum prices

The remarkable growth of mobile communication has reinforced the significance of the radio spectrum for mobile network operators. The availability of spectrum varies considerably between different countries due to national regulatory decisions. The focus in this paper is on India where operators have access to a limited amount of spectrum. This paper analyses the value of spectrum by estimating the opportunity cost, which is calculated by the savings that can be achieved by acquiring appropriate amount of spectrum rather than investing in additional base stations. The applied approach combines network deployment, user demand levels, cost, and capacity issues, which are integrated in the application in the opportunity cost approach for spectrum. The opportunity cost of spectrum is compared with prices paid at spectrum auctions. The analysis includes a discussion of drivers that determine the willingness to pay for spectrum. The results show that the opportunity cost of spectrum in relation to auction prices is lower than prices operators paid for 3G spectrum in the metro circles (service areas) while the value derived from the opportunity cost is higher than auction prices in the remaining circles.     

Securities auctions with pre-project information management

This paper analyzes securities auctions in which bidders have an option to acquire information after winning the right to develop a project. The payment consists of an up-front cash bid and a contingent security bid, which distorts investment and information acquisition relative to the first-best. We order securities in terms of their steepness: the payment of a steeper security is more sensitive to high project values. The agent’s incentives to acquire information that prevents either cost overruns (Type I errors) or false cancellations (Type II errors) decrease with the steepness of securities. The optimal limited-liability securities auction involves bidding debt that minimizes the distortions in the agent’s incentives to acquire performance-enhancing information. The model delivers implications on the practices commonly observed in oil lease auctions.     

Resale and bundling in auctions

The possibility of resale increases bidders' incentives to jointly reduce demand in multi-object auctions, because resale increases low-value bidders' willingness to pay and reduces high-value bidders' willingness to pay. Therefore, resale may reduce the seller's revenue. In a simple model with complete information, however, allowing resale and bundling the objects on sale are “complement strategies” for the seller (under reasonable conditions)—by bundling and allowing resale the seller earns a higher revenue than by selling the objects separately and/or forbidding resale. We also show why allowing resale may reduce efficiency.     

Hiccups in US spectrum auctions

While an increasing number of countries have embraced auctions to assign radio frequency, many other countries have decided to retain selection by the administration. Of the many factors that might have influenced those countries that have rejected auctions, one of the most visible in Europe has been frequent media reports of the problems experienced with auctions in the US between 1995 and 1997. In my experience, these reports have been accepted at face value by many European industry commentators and policy officials. It seems clear that the repeated reporting of these problems has influenced the evolution of spectrum management policy in Europe. This paper tries to set the record straight by providing an analysis of the problems that were reported in Europe regarding US spectrum auctions, specifically the declarations of bankruptcy by several winning bidders and overbidding by participants, the enormous revenue shortfall on the WCS block auction, and reports of collusion among bidders.     

Information disclosure in optimal auctions

This paper analyzes a situation in which the seller controls the accuracy of what potential buyers learn about their valuation of a good to be sold. This setting is related to many real situations such as home sales, antique auctions, and digital platforms such as Google and Facebook selling online advertising slots. Two important questions arise: what is the optimal selling mechanism, and what is the optimal disclosure policy of the seller. Under the assumption of private values, a simple auction with a reserve price is the optimal mechanism. What we show is that the amount of (costly) information provided increases with the number of potential bidders when using the optimal mechanism and is greater than when the object is always sold. Because information changes the distribution of a bidder’s expected valuations, the optimal reserve price also changes, so that the number of bidders (indirectly) affects the reserve price. We show that as the number of bidders increases, the optimal reserve price becomes more restrictive.     

Asymmetric information in oil and gas lease auctions with a national company

This paper analyzes bidding behavior in oil and gas tract auctions in Brazil, where the main winner has been Petrobras, a national company. We test predictions from the theory of common-value, first-price, sealed-bid auctions with asymmetric information. The tests indicate that Petrobras was better informed about tract values than other bidders. We show that Petrobras bid higher than its competitors for more profitable tracts, and that it bid more frequently than its competitors for tracts being re-offered after receiving no bids in previous auctions. We also find evidence that Petrobras could bid competitively in a limited number of auctions only, and we discuss how our results can help to improve oil and gas tract auction rules.     

Synergistic valuations and efficiency in spectrum auctions

In spectrum auctions, bidders typically have synergistic values for combinations of licenses. This has been the key argument for the use of combinatorial auctions in the recent years. Considering synergistic valuations turns the allocation problem into a computationally hard optimization problem that generally cannot be approximated to a constant factor in polynomial time. Ascending auction designs such as the Simultaneous Multiple Round Auction (SMRA) and the single-stage or two-stage Combinatorial Clock Auction (CCA) can be seen as simple heuristic algorithms to solve this problem. Such heuristics do not necessarily compute the optimal solution, even if bidders are truthful. We study the average efficiency loss that can be attributed to the simplicity of the auction algorithm with different levels of synergies. Our simulations are based on realistic instances of bidder valuations we inferred from bid data from the 2014 Canadian 700 MHz auction. The goal of the paper is not to reproduce the results of the Canadian auction but rather to perform “out-of-sample” counterfactuals comparing SMRA and CCA under different synergy conditions when bidders maximize payoff in each round. With “linear” synergies, a bidder's marginal value for a license grows linearly with the total number of licenses won, while with the “extreme national” synergies, this marginal value is independent of the number of licenses won unless the bidder wins all licenses in a national package. We find that with the extreme national synergy model, the CCA is indeed more efficient than SMRA. However, for the more realistic case of linear synergies, SMRA outperforms various versions of CCA that have been implemented in the field including the one used in the Canadian 700 MHz auction. Overall, the efficiency loss of all ascending auction algorithms is small even with high synergies, which is remarkable given the simplicity of the algorithms.     

Horizontal mergers with synergies: Cash vs. profit-share auctions

We consider takeover bidding in a Cournot oligopoly when firms have private information concerning the synergy effect of merging with a takeover target and bidders can influence rivals' beliefs through their bids. We compare cash and profit-share auctions, first- and second-price, supplemented by entry fees. Since non-merged firms benefit from a merger if synergies are low, bidders are subject to a positive externality with positive probability; nevertheless, pooling does not occur. Unlike cash auctions, profit-share auctions are not revenue equivalent, and the second-price profit-share auction is more profitable than the other auctions.     

Spectrum auctions in India: lessons from experience

Spectrum auctions have been used with significant success in many developed countries. From a regulatory and policy perspective, spectrum auctions ensure the efficient use of spectrum by allocating it to those entities that value it most, while also generating revenues for governments. But auctions may lead to unexpected outcomes due to unanticipated problems with their design leading to unexpected bidder behavior such as collusion and over-bidding. The key challenge before regulatory agencies is to design auctions in such a way as to meet the objective of fostering competition while at the same time ensuring that bidders can effectively use the spectrum for their business. While India was one of the early adopters of spectrum auctions, its success in service provision has been low. This paper critically examines issues in auction design that contributed to this delay and reviews the key elements in the design process namely a coherent regulatory framework, choice of service areas, flexibility for service area consolidation, standards and their role, convergence, managing public service regulation and managing defaults. The paper compares the handling of these elements in auctions in the United States (US), United Kingdom (UK) and Australia with the objective of drawing lessons for Indian policy makers.     

Affirmative action subcontracting regulations in dynamic procurement auctions

I study affirmative action subcontracting regulations in a model where governments use auctions to repeatedly procure goods and services at the lowest possible price. Through using disadvantaged subcontractors, prime contractors build relationships over time, resulting in lower subcontracting costs in future periods. I find that regulation in the form of a minimum subcontracting requirement expands bidder asymmetries, favoring prime contractors with stronger relationships over those with weaker ones. Simulations show that the manner in which relationships evolve determines not only the utilization of disadvantaged subcontractors but also the procurement costs attained under affirmative action.     

Fighting collusion in auctions: An experimental investigation

The danger of collusion presents a serious challenge for auctioneers. In this paper, we compare the collusive properties of two standard auctions, the English auction and the first-price sealed-bid auction, and a lesser-known format, the Amsterdam (second-price) auction. In the Amsterdam auction, the highest losing bidder earns a premium for stirring up the price. We study two settings: in one, all bidders can collude, and in another, only a subset is eligible. The experiments show that the Amsterdam auction triggers less collusion than the standard auctions. We compare experimental results to theoretical predictions, and provide an explanation where they differ.