The value of an informed bidder in common value auctions

I compare two information structures in a common value first-price auction with two bidders: In one, each of the two bidders knows only his own signal about the value of the object, and in the other, one of the bidders learns his opponent's signal as well. Gaining the additional information in the second information structure makes the informed bidder worse off if the value is submodular in the bidders' signals and better off if it is supermodular. If the value is supermodular, then the seller's revenue tends to be lower with the informed bidder than without.     

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.     

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.     

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.     

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.     

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.     

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.     

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     

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.     

Bidding behavior in competing auctions: Evidence from eBay

Much of the existing auction literature treats auctions as running independently of one another, with each bidder choosing to participate in only one auction. However, in many online auctions, a number of substitutable goods are auctioned concurrently and bidders can bid on several auctions at the same time. Recent theoretical research shows how bidders can gain from the existence of competing auctions, the current paper providing the first empirical evidence in support of competing auctions theory using online auctions data from eBay. Our results indicate that a significant proportion of bidders do bid across competing auctions and that bidders tend to submit bids on auctions with the lowest standing bid, as the theory predicts. The paper also shows that winning bidders who cross-bid pay lower prices on average than winning bidders who do not.     

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.     

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.     

Charity auctions with multiple goods: Bidding behavior and revenue

In a charity auction with multiple goods, we show that the highest-losing bid uniform price auction revenue dominates its lowest-winning bid counterpart. Only in the highest-losing bid uniform price auction is bidding independent of the number of goods and players and revenue increasing in the number of goods.     

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.     

Efficient collusion in repeated auctions with communication

This paper studies collusion in repeated auctions when bidders communicate prior to each stage auction. For independent and correlated private signals and general interdependent values, the paper identifies conditions under which an equilibrium collusion scheme is fully efficient in the sense that the bidders’ payoff is close to what they get when the object is allocated to the highest valuation bidder at the reserve price in every period.     

Asymmetric auctions with resale: An experimental study

We study auctions with resale based on Hafalir and Krishna's (2008) [6] model. As predicted, weak bidders bid more with resale than without, so that average auction prices tend to increase. When the equilibrium calls for weak types to bid higher than their values with resale they do, but not nearly as much as the theory predicts. In other treatments outcomes are much closer to the risk neutral Nash model's predictions. Bid distributions for weak and strong types are more similar with resale than without, in line with the theory.     

Core-stable rings in auctions with independent private values

We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative) partition form game. A coalition is core-stable if the core of a suitable characteristic function, derived from the partition form game, is not empty. As an application, we study collusion in auctions in which the bidders? final utility possibly depends on the winner?s identity. We show that such direct externalities offer a possible explanation for cartels? structures (not) observed in practice.     

Sealed bid auctions with ambiguity: Theory and experiments

This study presents a laboratory experiment of the first and second price sealed bid auctions with independent private values, where the distribution of bidder valuations may be unknown. In our experimental setting, in first price auctions, bids are lower with the presence of ambiguity. This result is consistent with ambiguity loving in a model that allows for different ambiguity attitudes. We also find that the first price auction generates significantly higher revenue than the second price auction with and without ambiguity.     

Bidding fever in eBay auctions of Amazon.com gift certificates

In a set of eBay auctions of Amazon.com gift certificates, 41.1% of winning prices exceed face value, which is an observable upper bound for rational bidding because Amazon.com sells certificates at face value. Alternative interpretations to bidding fever are explored.