Asymmetric English auctions

This paper studies equilibria of the n-bidder single-object English, or open ascending price, auction in a setting with interdependent values and asymmetric bidders. Maskin (in: H. Siebert (Ed.), Privatization, Institut fur Weltwirtschaften der Universität Kiel, Kiel, 1992, pp. 115-136.) showed that if the values satisfy a “single crossing” condition, then the two-bidder English auction has an efficient equilibrium. In this paper, two extensions of the single crossing condition, the “average crossing” condition and the “cyclical crossing” condition, are introduced. The main result is that under either of these conditions the n-bidder English auction has an efficient equilibrium.     

Best-of-three all-pay auctions

We study a best-of-three all-pay auction. It is shown that with values of winning and without values of losing, this auction is less productive (the players’ total expected effort is smaller) than the one-stage all-pay auction. However, with different values of losing over the contest’s stages it may be more productive than the one-stage all-pay auction.     

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.     

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.     

Revenue ranking of first-price auctions with resale

When the price setter in post-auction resale is chosen according to exogenous probabilities, Hafalir and Krishna (2008) [2] showed that the first-price auction brings more expected revenues than the second-price auction with truth-bidding bidders. We complete their revenue ranking by proving that the first-price auction produces higher expected revenues the higher the probability the auction winner sets the resale price.     

Multidimensional private value auctions

We consider parametric examples of symmetric two-bidder private value auctions in which each bidder observes her own private valuation as well as noisy signals about her opponent's private valuation. We show that, in such environments, the revenue equivalence between the first and second price auctions (SPAs) breaks down and there is no definite revenue ranking; while the SPA is always efficient allocatively, the first price auction (FPA) may be inefficient; equilibria may fail to exist for the FPA. We also show that auction mechanisms provide different incentives for bidders to acquire costly information about opponents’ valuation.     

Selection effects in auctions for monopoly rights

We demonstrate that auctioning market licenses may result in higher market prices than assigning them via more random allocation mechanisms. When future market profit is uncertain, winning an auction is like winning a lottery ticket. If firms differ in risk attitudes, auctions select the least risk-averse firm, which, in turn, set a higher price (or a higher quantity, in case quantity is the decision variable) in the marketplace than an average firm.     

Asymmetric first price auctions

A new approach to asymmetric first price auctions is proposed which circumvents the need to examine bidding strategies directly. Specifically, the ratio of bidders' (endogenous) payoffs is analyzed and compared to the ratio of the (exogenous) distribution functions that describe beliefs. Most of the results are inferred from this comparison. In the existing theoretical literature, assumptions of first order stochastic dominance or stronger imply that the latter ratio has very specific properties, but no such assumptions are imposed here. It is proven that first order stochastic dominance is necessary for bidding strategies not to cross. When this assumption is relaxed in the numerical literature it is done in a manner that leads to exactly one crossing. However, it is straightforward to construct examples with several crossings. Finally, bid distributions will cross in auctions with two bidders whenever second order (but not first order) stochastic dominance applies.     

Optimal collusion-proof auctions

We study an optimal collusion-proof auction in an environment where subsets of bidders may collude not just on their bids but also on their participation. Despite their ability to collude on participation, informational asymmetry facing the potential colluders can be exploited significantly to weaken their collusive power. The second-best auction — i.e., the optimal auction in a collusion-free environment — can be made collusion-proof, if at least one bidder is not collusive, or there are multiple bidding cartels, or the second-best outcome involves a non-trivial probability of the object not being sold. Regardless, optimal collusion-proof auction prescribes non-trivial exclusion of collusive bidders, i.e., a refusal to sell to any collusive bidder with positive probability.     

Asymmetric first-price menu auctions under intricate uncertainty

This paper studies asymmetric first-price menu auctions in the procurement environment where the buyer does not commit to a decision rule and asymmetric sellers have interdependent costs and statistically affiliated signals. Sellers compete in bidding a menu of contracts, where a contract specifies a vector of characteristics and a payment required from the buyer for delivering these characteristics. The buyer does not commit ex-ante to a decision rule but rather upon observing all the menus offered by sellers chooses the best contract. This paper establishes the existence of a continuum of separating monotone equilibria in this game bounded above by the jointly ex-post efficient outcome and below by the jointly interim efficient outcome. It shows that the jointly ex-post efficient equilibrium outcome is the only ex-post renegotiation-proof outcome and it is also ex-ante robust to all continuation equilibria.     

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.     

Competing auctions with endogenous quantities

Two sellers decide on their discrete supply of a homogenous good. There is a finite number of buyers with unit demand and privately known valuations. In the first model, there is a centralized market place where a uniform auction takes place. In the second, there are two distinct auction sites, each with one seller, and buyers decide where to bid. Using the theory of potential games, we show that in the one-site auction model there is always an equilibrium in pure-strategies. In contrast, if the distribution of buyers values has an increasing failure rate, and if the marginal cost of production is relatively low, there is no pure-strategy equilibrium where both sellers make positive profits in the competing sites model. We also identify conditions under which an equilibrium with a unique active site exists. We deal with the finite and discrete models by using several results about order statistics developed by Richard Barlow and Frank Proschan [R. Barlow, F. Proschan, Mathematical Theory of Reliability, Wiley, New York, 1965; R. Barlow, F. Proschan, Inequalities for linear combinations of order statistics from restricted families, Ann. Math. Statist. 37 (1966) 1593-1601; R. Barlow, F. Proschan, Statistical Theory of Reliability and Life Testing, McArdle Press, Silver Spring, 1975].     

On optimal head starts in all-pay auctions

We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer’s objective is to maximize a convex combination of the expected highest effort and the expected aggregate effort. Unless the weight on the highest effort is one, small head starts are always worse than no head start. Moreover, the optimal head start is strictly positive if and only if the weight on the highest effort is large enough.     

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).     

An elementary proof of the common maximal bid in asymmetric first-price and all-pay auctions

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.     

The relative contributions of private information sharing and public information releases to information aggregation

We calculate learning rates when agents are informed through public and private observation of other agents' actions. We characterize the evolution of the distribution of posterior beliefs. If the private learning channel is present, convergence of the distribution of beliefs to the perfect-information limit is exponential at a rate equal to the sum of the mean arrival rate of public information and the mean rate at which individual agents are randomly matched with other agents. If, however, there is no private information sharing, then convergence is exponential at a rate strictly lower than the mean arrival rate of public information.     

Delay and information aggregation in stopping games with private information

We consider equilibrium timing decisions in a model with a large number of players and informational externalities. The players have private information about a common payoff parameter that determines the optimal time to invest. They learn from each other in real time by observing past investment decisions. We develop new methods of analysis for such large games, and we give a full characterization of symmetric equilibria. We show that the equilibrium statistical inferences are based on an exponential learning model. Although the beliefs converge to truth, learning takes place too late. Ex-ante welfare is strictly between that without observational learning and that with full information.     

Efficient collusion in optimal auctions

We study collusion in an IPV auction with binary type spaces. Collusion is organized by a third party that can manipulate participation decisions. We characterize the optimal response of the seller to different threats of collusion among the bidders. We show that, contrary to the prevailing view that asymmetric information imposes transaction costs in side contracting, collusion in the optimal auction is efficient when the third party can implement monetary transfers as well as when it can implement monetary transfers and reallocations of the good. The threat of non-participation in the auction by a subset of bidders is crucial in constraining the seller's profit.     

Correlated information, mechanism design and informational rents

Crémer and McLean (Econometrica 56 (1988) 1247-1258) obtain a sufficient and necessary condition for full surplus extraction in Bayesian-Nash equilibrium—the rank condition, which McAfee and Reny (Econometrica 60(2) (1992) 395-421) later generalize for continuous type spaces. This paper shows that, if the principal does not know how noisy is the agent's signal—or equivalently, when signals available to an agent can be ranked by Blackwell's informativeness and, an agent's informativeness is independent of others’ information, the rank condition fails to hold. Conversely, when rank condition fails and informational rents are left to an agent, the model can be interpreted as if, the principal were uncertain about the informativeness of the agent's signal.     

The impact of public information on bidding in highway procurement auctions

A number of papers in the theoretical auction literature show that the release of information regarding the seller's valuation of an item can cause bidders to bid more aggressively. This widely accepted result in auction theory remains largely untested in the empirical literature. Recent theoretical work has also shown that this effect can be more pronounced in auctions with larger common cost uncertainty. We examine the impact of a policy change by the Oklahoma Department of Transportation that led to the release of the state's internal estimate of the costs to complete highway construction projects. We perform a differences-in-differences analysis comparing bidding in Texas, a state that had a uniform policy of revealing the same information all throughout the period of analysis, to bidding in Oklahoma. Our results show that, in comparison to Texas auctions, the average bid in Oklahoma fell after the change in engineers’ cost estimate (ECE) policy. This decline in bids was even larger for projects where the common uncertainty in costs is greater. Moreover, the within-auction standard deviation of bids fell after the change in ECE policy with the most significant decline observed again in projects with greater common cost uncertainty.