Auction theory

Auction theory

Auction theory is an applied branch of game theory which deals with how people act in auction markets and researches the game-theoretic properties of auction markets. There are many possible designs (or sets of rules) for an auction and typical issues studied by auction theorists include the efficiency of a given auction design, optimal and equilibrium bidding strategies, and revenue comparison. Auction theory is also used as a tool to inform the design of real-world auctions; most notably auctions for the privatisation of public-sector companies or the sale of licenses for use of the electromagnetic spectrum.

Types of auction

There are traditionally four types of auction that are used for the allocation of a single item:

* First-price sealed-bid auctions in which bidders place their bid in a sealed envelope and simultaneously hand them to the auctioneer. The envelopes are opened and the individual with the highest bid wins, paying a price equal to the exact amount that he or she bid.
* Second-price sealed-bid auctions (Vickrey auctions) in which bidders place their bid in a sealed envelope and simultaneously hand them to the auctioneer. The envelopes are opened and the individual with the highest bid wins, paying a price equal to the exact amount of the "second highest" bid.
* Open Ascending-bid auctions (English auctions) in which the price is steadily raised by the auctioneer with bidders dropping out once the price becomes too high. This continues until there remains only one bidder who wins the auction at the current price.
* Open Descending-bid auctions (Dutch auctions) in which the price starts at a level sufficiently high to deter all bidders and is progressively lowered until a bidder indicates that he is prepared to buy at the current price. He or she wins the auction and pays the price at which they bid.

Most auction theory revolves around these four "standard" auction types. However, other auction types have also received some academic study, such as:

* All pay auctions in which bidders place their bid in a sealed envelope and simultaneously hand them to the auctioneer. The envelopes are opened and the individual with the highest bid wins, paying a price equal to the exact amount that he or she bid. All losing bidders are also required to make a payment to the auctioneer equal to their own bid in an all-pay auction. This auction format is non-standard, but can be used to understand things such as election campaigns (in which bids can be interpreted as campaign spending) or queuing for a scarce commodity (in which your bid is the amount of time for which you are prepared to queue).
* Unique bid auctions
* Many homogenous item auctions, e.g., spectrum auctions
* Simultaneous multiple-round auctions

Game-theoretic models

A game-theoretic auction model is a mathematical game represented by a set of playersset of players, a set of actions (strategies) available to each player, and a payoff vector corresponding to each combination of strategies. Generally, the players are the buyer(s) and the seller(s). The action set of each player is a set of bid functions or reservation prices. Each bid function maps the player's value (in the case of a buyer) or cost (in the case of a seller) to a bid price. The payoff of each player under a combination of strategies is the expected utility (or expected profit) of that player under that combination of strategies.

Game-theoretic models of auctions and strategic bidding generally fall into either of the following two categories. In a private value model, each participant (bidder) assumes that each of the competing bidders obtains a random "private value" from a probability distribution. In a common value model, each participant assumes that any other participant obtains a random signal from a probability distribution common to all bidders. Usually, but not always, a private values model assumes that the values are independent across bidders, whereas a common value model usually assumes that the values are independent up to the common parameters of the probability distribution.

. An important example (which does not assume independence) is Milgrom and Weber's "general symmetric model" (1982). [Milgrom, P., and R. Weber (1982) "A Theory of Auctions and Competitive Bidding," Econometrica Vol. 50 No. 5, pp. 1089–1122.] [Because bidders in real-world auctions are rarely symmetric, applied scientists began to research auctions with asymmetric value distributions beginning in the late 1980s. Such applied research often depended on numerical solution algorithms to compute an equilibrium and establish its properties. Preston McAfee and John McMillan (1989) simulated bidding for a government contract in which the cost distribution of domestic firms is different from the cost distribution of the foreign firms ("Government Procurement and International Trade," "Journal of International Economics", Vol. 26, pp. 291-308.) One of the publications based on the earliest numerical research is Dalkir, S., J. W. Logan, and R. T. Masson, "Mergers in Symmetric and Asymmetric Noncooperative Auction Markets: The Effects on Prices and Efficiency," published in Vol. 18 of "The International Journal of Industrial Organization", (2000, pp. 383–413). Other pioneering research include Tschantz, S., P. Crooke, and L. Froeb, "Mergers in Sealed versus Oral Auctions," published in Vol. 7 of "The International Journal of the Economics of Business" (2000, pp. 201–213).] One of the earlier published theoretical research addressing properties of auctions among asymmetric bidders is Keith Waehrer's 1999 article. [K. Waehrer (1999) "Asymmetric Auctions With Application to Joint Bidding and Mergers," International Journal of Industrial Organization 17: 437-452] Later published research include Susan Athey's 2001 Econometrica article, [Athey, S. (2001) "Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information," Econometrica Vol. 69 No. 4, pp. 861-890.] as well as Reny and Zamir (2004). [Reny, P., and S. Zamir (2004) "On the Existence of Pure Strategy Monotone Equilibria in Asymmetric First-Price Auctions," Econometrica, Vol. 72 No. 4,pp. 1105–1125.]

In a simple first-price auction model with two buyers are bidding for an object, each buyer might assume that the rival buyer's private value is drawn from the uniform distribution over the interval [0,1] , with the cumulative distribution function F(v) = v. (Since F is symmetric between the two buyers, this is an auction model with symmetric bidders.) Assuming that: (i) the value of the object for the seller is 0, and (ii) the seller's reservation price is also 0, [This assumption implies that the seller is not acting strategically; strictly speaking, the seller is not a player in this example.] each buyer's expected utility U as a function of his/her bid price p is equal to the consumer surplus that the buyer will receive conditional on winning (v - p), multiplied by the likelihood that he or she is going to be the buyer with the highest bid price. That likelihood is given by the probability that this buyer's bid price p exceeds the other buyer's bid price B (expressed as a function of the other buyer's value v_o). Express this probability as Pr{p > B(v_o)}. Then, U(p) = (v - p) Pr{p > B(v_o)}. Assume that each buyer's equilibrium bid price is monotonically increasing in that buyer's value; this implies that the bid function B has an inverse function. Let Y be the inverse of B: Y=B^{-1}. Then U(p) = (v - p) Pr{Y(p) > v_o}. Since v_o is distributed F(v_o), Pr{Y(p) > v_o} = F(Y(p)) = Y(p), which implies U(p) = (v - p)Y(p). Differentiating with respect to p and setting to zero, ,U'(p) = -Y(p) + (v - p)Y'(p) = 0. Since the buyers are symmetric, in equilibrium it must be the case that p = B(v) or (equivalently) Y(p) = v. Therefore ,-Y(p) + (Y(p) - p)Y'(p) = 0. A solution hat Y of this differential equation is an inverse Nash equilibrium strategy of this game.

At this point, one may conjecture that the (unique) solution is the linear function ,hat Y(p) = ap and ,hat Y'(p) = a for some real number a. Substituting into ,U'(p) = 0, -ap + (ap - p)a = 0 or -p + (a - 1)p = 0. Solving for a yields hat a = 2. Therefore hat Y(p) = 2p satisfies ,U'(p) = 0. hat Y(p) = hat a p implies hat Y(p)/hat a = p, or v/hat a = hat B(v). Thus, the (unique) Nash equilibrium strategy bidding function of this game is established as hat B(v) = v/2.

Revenue equivalence

One of the major findings of Auction Theory is the celebrated Revenue Equivalence Theorem, which states that any allocation mechanism/auction in which (i) the bidder with the highest type/signal/value always wins, (ii) the bidder with the lowest possible type/value/signal expects zero surplus, (iii) where all bidders are risk neutral and (iv) drawn from a strictly increasing and atomless distribution will lead to the same revenue for the seller (and player i of type v can expect the same surplus across auction types).

Winner's curse

The winner's curse is a phenomenon which can occur in "common value" settings--when the actual values to the different bidders are unknown but correlated, and the bidders make bidding decisions based on estimated. In such cases, the winner will tend to be the bidder with the highest estimate, and that winner will frequently have bid too much for the auctioned item.

In an equilibrium of such a game, the winner's curse does not occur because the bidders account for the bias in their bidding strategies. Nonetheless, models of such auctions can help identify the winner's curse.

JEL Classification

In the Journal of Economic Literature Classification System C7 is the classification for Game Theory and D44 is the classification for Auctions.cite web
title = Journal of Economic Literature Classification System
publisher = American Economic Association
url =
format = HTML
accessdate = 2008-06-25
(D: Microeconomics, D4: Market Structure and Pricing, D44: Auctions)]


Further reading

* [ Draft edition available online]
* citation
author = McAfee, R. P. and J. McMillan
title = Auctions and Bidding
journal = Journal of Economic Literature
volume = 25
pages = 708-47
year = 1987

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Auction — Auctioneer redirects here. For the DC Comics supervillain, see Auctioneer (comics). An auctioneer and her assistants scan the crowd for bidders. An auction is a process of buying and selling goods or services by offering them up for bid, taking… …   Wikipedia

  • Auction sniping — is the process of watching a timed online auction (such as on eBay), and placing a winning bid at the last possible moment (often seconds before the end of the auction), giving the other bidders no time to outbid the sniper. Some bidders do this… …   Wikipedia

  • Double auction — A double auction is a process of buying and selling goods when potential buyers submit their bids and potential sellers simultaneously submit their ask prices to an auctioneer, and then an auctioneer chooses some price p that clears the market:… …   Wikipedia

  • Unique bid auction — A unique bid auction is a type of strategy game related to traditional auctions where the winner is usually the individual with the lowest unique bid, although less commonly the auction rules may specify that the highest unique bid is the winner …   Wikipedia

  • Dutch auction — 1957 in Germany to sell fruits A Dutch auction is a type of auction where the auctioneer begins with a high asking price which is lowered until some participant is willing to accept the auctioneer s price, or a predetermined reserve price (the… …   Wikipedia

  • Vickrey auction — A Vickrey auction is a type of sealed bid auction, where bidders submit written bids without knowing the bid of the other people in the auction. The highest bidder wins, but the price paid is the second highest bid. The auction was created by… …   Wikipedia

  • Combinatorial auction — A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages,” rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for… …   Wikipedia

  • Online travel auction — An online travel auction is a system of buying and selling travel products and services online by proffering them up for bid and then awarding the item to the highest bidder. As with a standard (offline) auction, the bidders, having made a… …   Wikipedia

  • English auction — An English auction is a type of auction, whose most typical form[clarification needed] is the open outcry auction. The auctioneer opens the auction by announcing a Suggested Opening Bid, a starting price or reserve for the item on sale and then… …   Wikipedia

  • Chinese auction — A Chinese auction is a combination of a raffle and an auction that is typically featured at charity, church festival and numerous other events. Can also be known as penny social, tricky tray or pick a prize according to local custom, or to avoid… …   Wikipedia