# 20.2: Sealed-bid Auction

- Last updated

- Save as PDF

- Page ID
- 45710

- No Attribution
- Anonymous by request

## LEARNING OBJECTIVE

- How should I bid if I don’t get to see the bids of others?

In a **sealed-bid auction**, each bidder submits a bid in an envelope. These are opened simultaneously, and the highest bidder wins the item and pays his or her bid. Sealed-bid auctions are used to sell offshore oil leases, and they are used by governments to purchase a wide variety of items. In a purchase situation, known often as a tender, the lowest bidder wins the amount he bids.

The analysis of the sealed-bid auction is more challenging because the bidders don’t have a dominant strategy. Indeed, the best bid depends on what the other bidders are bidding. The bidder with the highest value would like to bid a penny more than the next highest bidder’s bid, whatever that might be.

To pursue an analysis of the sealed-bid auction, we are going to make a variety of simplifying assumptions. These assumptions aren’t necessary to the analysis, but we make them to simplify the mathematical presentation.

We suppose there are *n* bidders, and we label the bidders 1, …, *n*. Bidder *i* has a private value *v*_{i}, which is a draw from the uniform distribution on the interval [0,1]. That is, if \(\begin{equation}0 \leq a \leq b \leq 1\end{equation}\), the probability that bidder *i*’s value is in the interval \(\begin{equation}[a, b] \text { is } b-a\end{equation}\). An important attribute of this assumption is symmetry—the bidders all have the same distribution. In addition, the formulation has assumed independence—the value one bidder places on the object for sale is statistically independent from the value placed by others. Each bidder knows his own value but he doesn’t know the other bidders’ values. Each bidder is assumed to bid in such a way as to maximize his expected profit (we will look for a Nash equilibrium of the bidding game). Bidders are permitted to submit any bid equal to or greater than zero.

To find an equilibrium, it is helpful to restrict attention to linear strategies, in which a bidder bids a proportion of her value. Thus, we suppose that each bidder bids λ*v* when her value is *v* and λ is a positive constant, usually between zero and one. With this set up we shall examine under what conditions these strategies comprise a Nash equilibrium. An equilibrium exists when all other bidders bid λ*v* when their value is *v*, and the remaining bidders bid the same.

So fix a bidder and suppose that bidder’s value is *v*_{i}. What bid should the bidder choose? A bid of *b* wins the bidding if all other bidders bid less than *b*. Because the other bidders, by hypothesis, bid λ*v* when their value is *v*, our bidder wins when b≥λ v j for each other bidder *j*. This occurs when b λ ≥ v j for each other bidder *j*, and this in turn occurs with probability b λ . If b>λ, then in fact the probability is 1. You can show that no bidder would ever bid more than λ. Thus, our bidder with value *v*_{i} who bids *b* wins with probability ( b λ ) n−1 because the bidder must beat all *n* −1 other bidders. That creates expected profits for the bidder of \(\begin{equation}n=(v i-b)(b \lambda) n-1\end{equation}\).

The bidder chooses *b* to maximize expected profits. The first-order condition requires \(\begin{equation}0=-(b \lambda) n-1+(v i-b)(n-1) b n-2 \lambda n-1\end{equation}\).

The first-order condition solves for \(\begin{equation}b=n-1 n v\end{equation}\).

But this is a linear rule. Thus, if \(\begin{equation}\lambda=n-1 n\end{equation}\), we have a Nash equilibrium.

The nature of this equilibrium is that each bidder bids a fraction λ= n−1 n of his value, and the highest-value bidder wins at a price equal to that fraction of her value.

In some cases, the sealed-bid auction produces regret. Regret means that a bidder wishes she had bid differently. Recall our notation for values: *v*_{(1)} is the highest value and *v*_{(2)} is the second-highest value. Because the price in a sealed-bid auction is \(\begin{equation}n-1 n \vee(1)\end{equation}\), the second-highest bidder will regret her bid when \(\begin{equation}v(2)>n-1 n \vee(1)\end{equation}\). In this case, the bidder with the second-highest value could have bid higher and won, if the bidder had known the winning bidder’s bid. In contrast, the English auction is regret-free: the price rises to the point that the bidder with the second-highest value won’t pay.

How do the two auctions compare in prices? It turns out that statistical independence of private values implies **revenue equivalence**, which means the two auctions produce the same prices on average. Given the highest value *v*_{(1)}, the second-highest value has distribution \(\begin{equation}(v(2) \vee(1)) n-1\end{equation}\) because this is the probability that all *n* − 1 other bidders have values less than *v*_{(2)}. But this gives an expected value of \(\begin{equation}v_{(2)} \text { of } \mathrm{E} v(2)=\int 0 \vee(1) \vee(2)(n-1) v(2) n-2 v(1) n-1 \text { d } v(2)=n-1 \text { n } v(1)\end{equation}\).

Thus, the average price paid in the sealed-bid auction is the same as the average price in the English auction.

## Key Takeaways

- In a sealed-bid auction, bids are opened simultaneously, and the highest bidder wins the item and pays his bid.
- The analysis of the sealed-bid auction is more challenging because the bidders don’t have a dominant strategy.
- When bidders have uniformly and independently distributed values, there is an equilibrium where they bid a constant fraction of value, n−1 n where
*n*is the number of bidders. - Statistical independence of private values implies revenue equivalence, which means English and sealed-bid auctions produce the same prices on average.