First-Price Auctions

First-Price Auctions are a type of sealed-bid auction in which all bidders submit their bids simultaneously without knowledge of the others' bids, and the highest bidder wins the item, paying exactly the amount they bid. Unlike second-price auctions, where the winner pays the second-highest bid, in first-price auctions, the winner pays their own bid, making strategic bidding behavior critical.

Auction Format and Rules

Sealed Bids

In a first-price auction, each participant submits a single bid in a sealed envelope or through a confidential electronic system. Bidders cannot observe others' bids before submitting their own, which introduces uncertainty about competitors' valuations and strategies.

Winner Determination

After all bids are submitted, the auctioneer opens all bids simultaneously. The bidder with the highest bid wins the auctioned item. In the case of a tie, a predetermined rule (such as random selection or awarding the item to the earliest high bid) determines the winner.

Payment

The winning bidder pays the exact amount of their bid. This payment rule distinguishes first-price auctions from other auction types, notably second-price auctions, which incentivize truthful bidding by charging the winner the second-highest bid.

Strategic Bidding Behavior

Bid Shading

Because the winner pays their own bid, rational bidders generally do not bid their true valuation of the item. Instead, they engage in "bid shading," submitting bids below their valuation to increase their expected payoff. The extent of bid shading depends on bidders' beliefs about competitors' valuations and risk attitudes.

Expected Payoff Maximization

Each bidder aims to maximize their expected utility, which equals the probability of winning multiplied by the difference between their valuation and the bid placed. Formally, if a bidder's valuation is v and the bid is b, their expected payoff is:

To optimize this, bidders analyze the distribution of bids and valuations among competitors.

Equilibrium Bidding Strategies

In symmetric independent private value settings, where each bidder’s valuation is drawn independently from the same known distribution, equilibrium bid functions can be derived. For example, if valuations are uniformly distributed over [0,1], the symmetric equilibrium bidding strategy for n bidders is to bid:

This formula shows that bidders shade their bids below their true valuation by a factor related to the number of competitors.

Comparison with Other Auction Formats

Versus Second-Price Auctions

In second-price auctions, bidders submit sealed bids but the winner pays the second-highest bid. This leads bidders to bid their true valuations since the price paid is independent of their own bid. In contrast, first-price auctions require strategic bid shading, adding complexity to bidding behavior.

Versus Open Ascending Auctions

Open ascending (English) auctions allow bidders to observe others’ bids and respond dynamically. First-price auctions lack this feedback mechanism, leading to strategic uncertainty and the need for probabilistic reasoning.

Applications and Economic Implications

Common Uses

First-price auctions are prevalent in government contract awards, procurement processes, and various online ad auctions where bidders must submit sealed offers and pay their bid if successful.

Revenue Equivalence

Under certain theoretical conditions (risk-neutral bidders, independent private values), first-price and second-price auctions generate the same expected revenue for the seller, a result known as the Revenue Equivalence Theorem. However, risk aversion or correlated valuations can alter the revenue ranking.

Efficiency

First-price auctions can achieve allocative efficiency by awarding the item to the highest valuer, but bid shading can reduce the surplus captured by bidders. Strategic complexity may also affect participation and bidding behavior.

Mathematical Framework for First-Price Auctions

Setup

• Let n be the number of bidders.
• Each bidder i has a private valuation v_i drawn independently from a distribution F with density f over support [v_min, v_max].
• Bids are functions b_i(v_i) mapping valuations to bids.

Symmetric Bayesian Nash Equilibrium

A bidding strategy b(v) is an equilibrium if no bidder can increase expected payoff by deviating, given others' strategies. The equilibrium condition can be expressed as:

This expression states that the bid is the valuation minus the expected payoff from bidding lower, integrated over the valuation distribution.

Extensions and Variations

Risk Aversion

If bidders are risk-averse, they tend to bid more aggressively (less shading) because winning at a lower bid is less attractive relative to the certainty of winning. This can increase seller revenue in comparison to risk-neutral settings.

Common-Value and Affiliated-Value Models

When bidders’ valuations are not independent or contain common elements, bidding behavior and equilibrium strategies become more complex. The winner's curse phenomenon influences bid shading and strategic decisions.

Multi-Unit and Combinatorial First-Price Auctions

First-price auction principles extend to auctions involving multiple identical or heterogeneous items, where bidders submit bids on bundles. Complexity increases, requiring advanced solution methods for equilibrium analysis.

Summary of Key Characteristics

First-price auctions represent a fundamental auction design balancing strategic complexity and practical applicability, requiring bidders to carefully consider their own valuations, competitors’ behavior, and risk preferences to optimize their bids.