Part of a series on
Auctions
Types
All-pay Chinese Amsterdam Anglo-Dutch Barter double Best/not best Brazilian Calcutta Candle Click-box bidding Combinatorial Common value Deferred-acceptance Discriminatory price Double Dutch English Forward French Generalized first-price Generalized second-price Japanese Knapsack Multi-attribute Multiunit No-reserve Rank Reverse Scottish Sealed first-price Simultaneous ascending Single-price Traffic light Uniform price Unique bid Value of revenues Vickrey Vickrey–Clarke–Groves Walrasian Yankee
Bidding
Shading Calor licitantis Cancellation hunt Jump Rigging Sniping Suicide Tacit collusion
Contexts
Algorithms Autos Art Charity Children Players Domain names Flowers Loans Scam Slaves Spectrum Stamps Virginity Wine Wives
Theory
Digital goods Price of anarchy Revenue equivalence Winner's curse
Online
Ebidding Private electronic market Software
v t e

A first-price sealed-bid auction (FPSBA) is a common type of auction. It is also known as blind auction.^[1] In this type of auction, all bidders simultaneously submit sealed bids so that no bidder knows the bid of any other participant. The highest bidder pays the price that was submitted.^{[2]: p2 [3]}

Strategic analysis

In a FPSBA, each bidder is characterized by their monetary valuation of the item for sale.

Suppose Alice is a bidder and her valuation is ${\displaystyle a}$. Then, if Alice is rational:

• She will never bid more than ${\displaystyle a}$, because bidding more than ${\displaystyle a}$ can only make her lose net value.
• If she bids exactly ${\displaystyle a}$, then she will not lose but also not gain any positive value.
• If she bids less than ${\displaystyle a}$, then she may have some positive gain, but the exact gain depends on the bids of the others.

Alice would like to bid the smallest amount that can make her win the item, as long as this amount is less than ${\displaystyle a}$. For example, if there is another bidder Bob and he bids ${\displaystyle y}$ and ${\displaystyle y<a}$, then Alice would like to bid ${\displaystyle y+\varepsilon }$ (where ${\displaystyle \varepsilon }$ is the smallest amount that can be added, e.g. one cent).

Unfortunately, Alice does not know what the other bidders are going to bid. Moreover, she does not even know the valuations of the other bidders. Hence, strategically, we have a Bayesian game - a game in which agents do not know the payoffs of the other agents.

The interesting challenge in such a game is to find a Bayesian Nash equilibrium. However, this is not easy even when there are only two bidders. The situation is simpler when the valuations of the bidders are independent and identically distributed random variables, so that the valuations are all drawn from a known prior distribution.^{[4]: 234–236}

Example

Suppose there are two bidders, Alice and Bob, whose valuations ${\displaystyle a}$ and ${\displaystyle b}$ are drawn from a continuous uniform distribution over the interval [0,1]. Then, it is a Bayesian-Nash equilibrium when each bidder bids exactly half his/her value: Alice bids ${\displaystyle a/2}$ and Bob bids ${\displaystyle b/2}$.

PROOF: The proof takes the point-of-view of Alice. We assume that she knows that Bob bids ${\displaystyle f(b)=b/2}$, but she does not know ${\displaystyle b}$. We find the best response of Alice to Bob's strategy. Suppose Alice bids ${\displaystyle x}$. There are two cases:

• ${\displaystyle x\geq f(b)}$. Then Alice wins and enjoys a net gain of ${\displaystyle a-x}$. This happens with probability ${\displaystyle f^{-1}(x)=2x}$.
• ${\displaystyle x<f(b)}$. Then Alice loses and her net gain is 0. This happens with probability ${\displaystyle 1-f^{-1}(x)}$.

All in all, Alice's expected gain is: ${\displaystyle G(x)=f^{-1}(x)\cdot (a-x)}$. The maximum gain is attained when ${\displaystyle G'(x)=0}$. The derivative is (see Inverse functions and differentiation):

${\displaystyle G'(x)=-f^{-1}(x)+(a-x)\cdot {1 \over f'(f^{-1}(x))))$

and it is zero when Alice's bid ${\displaystyle x}$ satisfies:

${\displaystyle f^{-1}(x)=(a-x)\cdot {1 \over f'(f^{-1}(x))))$

Now, since we are looking for a symmetric equilibrium, we also want Alice's bid ${\displaystyle x}$ to equal ${\displaystyle f(a)}$. So we have:

${\displaystyle f^{-1}(f(a))=(a-f(a))\cdot {1 \over f'(f^{-1}(f(a)))))$

${\displaystyle a=(a-f(a))\cdot {1 \over f'(a)))$

${\displaystyle af'(a)=(a-f(a))}$

The solution of this differential equation is: ${\displaystyle f(a)=a/2}$.

Generalization

Denote by:

• ${\displaystyle v_{i))$ - the valuation of bidder ${\displaystyle i}$;
• ${\displaystyle y_{i))$ - the maximum valuation of all bidders except ${\displaystyle i}$, i.e., ${\displaystyle y_{i}=\max _{j\neq i}{v_{j))}$.

Then, a FPSBA has a unique symmetric BNE in which the bid of player ${\displaystyle i}$ is given by:^{[5]: 33–40}

${\displaystyle E[y_{i}|y_{i}<v_{i}]}$

Incentive-compatible variant

The FPSBA is not incentive-compatible even in the weak sense of Bayesian-Nash-Incentive-Compatibility (BNIC), since there is no Bayesian-Nash equilibrium in which bidders report their true value.

However, it is easy to create a variant of FPSBA which is BNIC, if the priors on the valuations are common knowledge. For example, for the case of Alice and Bob described above, the rules of the BNIC variant are:

• The highest bidder wins;
• The highest bidder pays 1/2 of his/her bid.

In effect, this variant simulates the Bayesian-Nash equilibrium strategies of the players, so in the Bayesian-Nash equilibrium, both bidders bid their true value.

This example is a special case of a much more general principle: the revelation principle.

Comparison to second-price auction

The following table compares FPSBA to sealed-bid second-price auction (SPSBA):

Auction:	First-price	Second-price
Winner:	Agent with highest bid	Agent with highest bid
Winner pays:	Winner's bid	Second-highest bid
Loser pays:	0	0
Dominant strategy:	No dominant strategy	Bidding truthfully is dominant strategy[6]
Bayesian Nash equilibrium[7]	Bidder ${\displaystyle i}$ bids ${\displaystyle {\frac {n-1}{n))v_{i))$	Bidder ${\displaystyle i}$ truthfully bids ${\displaystyle v_{i))$
Auctioneer's revenue[7]	${\displaystyle {\frac {n-1}{n+1))}$	${\displaystyle {\frac {n-1}{n+1))}$

The auctioneer's revenue is calculated in the example case, in which the valuations of the agents are drawn independently and uniformly at random from [0,1]. As an example, when there are ${\displaystyle n=2}$ agents:

• In a first-price auction, the auctioneer receives the maximum of the two equilibrium bids, which is ${\displaystyle \max(a/2,b/2)}$.
• In a second-price auction, the auctioneer receives the minimum of the two truthful bids, which is ${\displaystyle \min(a,b)}$.

In both cases, the auctioneer's expected revenue is 1/3.

This fact that the revenue is the same is not a coincidence - it is a special case of the revenue equivalence theorem. This holds only when the agents' valuations are statistically independent; when the valuations are dependent, we have a common value auction, and in this case, the revenue in a second-price auction is usually higher than in a first-price auction.

The item for sale may not be sold if the final bid is not high enough to satisfy the seller, that is, the seller reserves the right to accept or reject the highest bid. If the seller announces to the bidders the reserve price, it is a public reserve price auction.^[8] In contrast, if the seller does not announce the reserve price before the sale but only after the sale, it is a secret reserve price auction.^[9]

Comparison to other auctions

A FPSBA is distinct from the English auction in that bidders can only submit one bid each. Furthermore, as bidders cannot see the bids of other participants, they cannot adjust their own bids accordingly.^[3]

FPSBA has been argued to be strategically equivalent to the Dutch auction.^[2]: p13

What are effectively FPSBA are commonly called tendering for procurement by companies and organizations, particularly for government contracts and auctions for mining leases.^[3] FPSBA are thought to lead to low procurement costs through competition and low corruption through increased transparency, even though they may entail a higher ex-post extra cost of the completed project and extra time to complete it.^[10]

A generalized first-price auction is a non-truthful auction mechanism for sponsored search (aka position auction).

A generalization of both 1st-price and 2nd-price auctions is an auction in which the price is some convex combination of the 1st and 2nd price.^[11]