Skip to content
Back to search results

First-Price Auction

Introduced by
William Vickrey
Year
1961
Type
algorithm
Family
Game-theoretic
Font size

What does it do?

A first-price auction is a sealed-bid mechanism where all participants submit bids simultaneously without knowing others' bids.

The highest bidder wins and pays their own bid (the price they offered). Systematically analyzed by William Vickrey in 1961, first-price auctions require bidders to balance between winning and profit, leading to strategic underbidding relative to true valuations in equilibrium.

The intuition behind the method

In a first-price auction, you face a trade-off: bid high to increase your chance of winning, but bid low to preserve profit if you win. Because you pay your own bid, not a competitor's, you must discount your valuation to leave a margin. In equilibrium, bidders shade their bids below true valuations by an amount that depends on how many competitors are bidding and the distribution of valuations. The key insight is that first-price auctions generate less transparency than second-price auctions and discourage truthful bidding.

History

William Vickrey's 1961 analysis of sealed-bid auctions formalized first-price auction theory, showing that equilibrium bid functions depend on the distribution of valuations. His work demonstrated that first-price and second-price auctions are revenue equivalent under independent valuations but can differ under affiliated valuations. This foundational analysis spawned decades of auction research and influenced practical auction design globally, from spectrum sales to online procurement.

When to use it

Use first-price auctions when the auctioneer wants high revenue and simplicity. Widely used in procurement (construction, government contracts), art and antiques, and real estate. Suitable when bidders have independent private valuations and a single item is being sold. First-price is often preferred when the auctioneer values revenue over transparency, as it typically yields higher prices than second-price auctions in practice.

Limitations and considerations

  • Non-truthful: bidders shade bids below valuations, leading to inefficient allocations in some cases
  • Strategic complexity: bidders must estimate the distribution of competitors' valuations
  • Vulnerability to bid shaving: small reductions in bid can prevent collusion and increase revenue
  • Weaker transparency: no guarantee of revenue equivalence with second-price across all distributions

Source conditions do not replace independent scientific review or validation by an analysis engine.

Strengths

  • High revenue: Strategic underbidding reduces payments less than second-price auctions
  • Simple mechanism: easy to understand and implement; winner pays bid
  • Practical: widely used in real-world auctions and government procurement
  • Robust to collusion: difficult for bidders to coordinate on shill bids without losing profit

Applications

  • Government procurement: sealed-bid contracts for construction, defense, and public works
  • Art and antiques auctions: Sotheby's and Christie's use variants of first-price for high-value artwork
  • Real estate: sealed-bid sales of commercial and residential property
  • Timber and mineral rights: sealed-bid auctions for extraction rights on public lands

How it works

How it works

1

Invite all potential bidders to submit sealed bids simultaneously without knowledge of competing bids.

2

Each bidder optimally shades their bid below true valuation, based on the number of bidders and distribution of valuations.

3

Identify the highest bidder as the winner of the object or contract.

4

The winner pays their own bid; all other bidders pay nothing and receive nothing.

Common pitfalls

  • Confusing first-price with second-price auctions; first-price requires bid shading, second-price does not
  • Assuming equilibrium bid functions without accounting for the precise distribution of valuations and number of bidders
  • Overlooking that revenue equivalence holds only under strong distributional assumptions (e.g., uniform or affiliated valuations)
  • Neglecting collusion risk: bidders can coordinate to submit artificially low bids, reducing revenue

Frequently asked questions

Why do bidders shade (reduce) their bids in first-price auctions?

Because you pay your own bid if you win, you must balance winning probability against profit margin. Bidding your true valuation would eliminate profit. Optimal bid shading depends on competitors' expected bids, which depends on their valuations and bidding strategy.

Is a first-price auction revenue-equivalent to a second-price auction?

Revenue equivalence holds when bidders have independent private valuations drawn from the same distribution. However, under affiliated valuations (common value components), first-price can yield higher revenue because bidders shade less aggressively.

How does the number of bidders affect equilibrium bidding in first-price auctions?

As the number of bidders increases, each bidder's shade decreases, and bid functions converge to true valuations. With few bidders, shade is more aggressive. This is because increased competition reduces the bidder's advantage from shading.

Related methods

Sources

  1. Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed bids. The Journal of Finance, 16(1), 8-37.

    Open DOI reference
    Copied.
  2. Krishna, V. (2009). Auction Theory (Second Edition). Academic Press.

    Open publication reference
    Copied.