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.     

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.     

Equilibrium bids in practical multi-attribute auctions

This article proposes a nonlinear scoring rule which transforms multiple attributes of a bid into comparable dimensionless ones. Practically, the buyer can use it to select the most competitive winner. For risk-neutral bidders, we characterize a symmetric Bayes–Nash equilibrium and find that as the number of bidders increases the equilibrium quality improves, whereas the equilibrium price decreases.     

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.     

Rates of information aggregation in common value auctions

We study the rates at which transaction prices aggregate information in common value auctions under the different information structures in Wilson (Rev. Econ. Stud. 44 (1977) 511) and Pesendorfer and Swinkels (Econometrica 65 (1997) 1247). We consider uniform-price auctions in which k identical objects of unknown value are auctioned to n bidders, where both n and k are allowed to diverge to infinity, and k/n converges to a number in [0,1). The Wilson assumptions lead to information aggregation at a rate proportional to , but the price aggregates information at a rate proportional to in the PS setting. We also consider English auctions, and investigate whether the extra information revealed in equilibrium improves convergence rates in these auctions.     

The effect of corruption on bidding behavior in first-price auctions

When the owner of an object sells it through an auction run by an agent of hers, corruption may appear. In a first-price auction, corruption can make honest bidders more or less aggressive, or their behavior can remain unchanged. We identify sufficient conditions for each of the three possibilities. We analyze the effects of corruption on efficiency, bidders’ welfare and expected revenue. Our results apply as well to the situation—unrelated to corruption—where one of the bidders is granted a right of first refusal.     

Existence of equilibrium in large double auctions

We show the existence of a pure strategy, symmetric, increasing equilibrium in double auction markets with correlated, conditionally independent private values and many participants. The equilibrium we find is arbitrarily close to fully revealing as the market size grows. Our results provide strategic foundations for price-taking behavior in large markets.     

Information structures in optimal auctions

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal information structures in an optimal auction exhibit a number of properties: (i) information structures can be represented by monotone partitions, (ii) the cardinality of each partition is finite, (iii) the partitions are asymmetric across agents. We show that an optimal information structure exists.     

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.     

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.     

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.     

Revenue equivalence in asymmetric auctions

The Revenue Equivalence Theorem is generalized to the case of asymmetric auctions in which each player's valuation is drawn independently from a common support according to his/her distribution function.     

On the informational inefficiency of discriminatory price auctions

We analyze bidding behavior in large discriminatory-price auctions in a common value setting where the number of objects is a non-trivial proportion of the number of bidders. We show that the average price paid in the auction is biased downward from the expected value of the objects, even in the competitive limit. We show that conditional on a signal that falls below a threshold, a bidder bids no more than the expected value of an object conditional on the signal and winning; while conditional on any signal that lies above the threshold the bid is strictly lower than the expected value conditional on the signal and winning.     

Multi-unit auctions with uniform prices

Summary. Auctions in which individuals can purchase more than one unit of the good being sold differ in striking ways from multi-unit auctions in which individuals may purchase only one unit. The uniform price auction in particular frequently yields Nash equilibria in which bidders underbid for their second unit and therefore pay very low prices for the good. This paper characterizes equilibria for the uniform price auction. Received: July 31, 1995; revised version: May 28, 1997     

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.     

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.     

Selling options

Contracts often take the form of options: oil fields can be abandoned, planning permission may go unused, and acquired firms can be liquidated. We consider a seller who auctions a dynamic option among N agents. After the auction, the economy evolves and the winning bidder chooses both if and when to execute the option. The revenue-maximising auction consists of an up-front bid and a contingent fee, where the latter is chosen in a Pigouvian manner, so the winning agent's choice of exercise time maximises the seller's revenue. This contingent payment is time- and state-invariant, so the seller does not have to observe post-auction information in order to implement the optimal auction. The revenue-maximising mechanism induces a dynamic distortion: the option is exercised later than under the comparable welfare-maximising mechanism.     

Trading with a common agent under complete information: A characterization of Nash equilibria

We analyze an abstract model of trading where N principals submit quantity-payment schedules that describe the contracts they offer to an agent, and the agent then chooses how much to trade with every principal. This represents a special class of common agency games with complete information. We study all the subgame perfect Nash equilibria of these games, not only truthful ones, providing a complete characterization of equilibrium payoffs. In particular, we show that the equilibrium that is Pareto-dominant for the principals is not truthful when there are more than two of them. We also provide a partial characterization of equilibrium strategies.     

The case for multi-unit single-run descending-price auctions

We show that a multiple-unit descending-price auction in which the clock is not reset after each sale may be faster and yield more stable prices than an efficient alternative, thus providing sellers a rationale for using it in practice.