This paper provides an elementary, non-technical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthcoming.) We begin with the most fundamental concepts, and then introduce the basic analysis of optimal auctions, the revenue equivalence theorem, and marginal revenues. Subsequent sections address risk-aversion, affiliation, asymmetries, entry, collusion, multi-unit auctions, double auctions, royalties, incentive contracts, and other topics. Appendices contain technical details, some simple worked examples, and a bibliography for each section.

Abstract not found

The revenue-equivalence theorem 1 for auctions predicts that expected seller revenue is independent of the bidding rules, as long as equilibrium has the properties that the buyer with the highest reservation price wins and any buyer with the lowest possible reservation price has zero expected surplus. Thus, in particular, the two most common auction institutions- the open "English " auction and the sealed high-bid auction- are equivalent despite their rather different strategic properties. This strong prediction of equivalence seems at odds, however, with the empirical observation that rarely is any given kind of commodity sold through more than one sort of auction. Thus, for example, art is nearly always auctioned off according to the English rules, whereas job contracts are normally awarded through sealed bids. Admittedly, in the public sector, there have been a few attempts to use both methods (lumber contracts in the Pacific Northwest) or to switch from one to the other (Treasury Bills). But changes have typically met great resistance. This is also in conflict with theory, since a corollary of the revenue equivalence theorem is that the expected surplus for any buyer is the same in the two auctions.

Abstract not found

Abstract not found

While there has been a long-standing interest in the theory of uniform-price auctions, there had been very little empirical analysis when the Treasury inaugurated its experiment with regular

The objects for sale in most auctions display both private and common value characteristics. This salient feature of many real-world auctions has not yet been incorporated into a strategic analysis of equilibrium bidding behavior. This paper reports such an analysis in the context of a stylized model in which bidders receive a private value signal and an independent common value signal. We show that more uncertainty about the common value results in lower efficiency and higher profits for the winning bidder. Information provided by the auctioneer decreases uncertainty, which improves efficiency and increases the seller’s revenue. These positive effects of public information disclosure are stronger the more precise the information. Efficiency and revenues are also higher when more bidders enter the auction. Since our model nests both the private and common value case it may lead to an improved specification of empirical models of auctions. JEL Classification: C72, D44.

Abstract not found

We consider parametric examples of 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. In such multidimensional private value auction environments, we show that the revenue equivalence between the first and second price auctions breaks down and there is no definite revenue ranking; while the second price auction is always efficient allocatively, the first price auction may be inefficient and the inefficiency may increase as the signal becomes more informative; equilibria may fail to exist for the first price auction. We also show that auction mechanisms provide different incentives for bidders to acquire costly information about opponents ’ valuation.

The migration of auctions to the Internet provides a unique opportunity to harness the power of computing to create new auction forms that were previously impossible. We describe a new type of combinatorial auction that accepts rule-based bids. Allowing bids in the form of high-level rules relieves the buyer from the burden of enumerating all possible acceptable bundles. The allocation of goods requires solving a complex combinatorial problem, a task that is completely impractical in a conventional auction setting. We describe simplifying winner determination heuristics developed in this study to make large problems of this nature manageable.