Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Game Theory›First-Price Auction
Machine learningGame-theoretic

First-Price Auction

First-Price Sealed-Bid Auction · Also known as: FPSB, Sealed-Bid Auction, Bid-Equal-Price Auction

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.

ScholarGate
  1. Machine learning
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

First-Price Auction
Bayesian Nash EquilibriumCournot CompetitionStackelberg CompetitionVCG Mechanism

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.

Strengths & limitations

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
Limitations
  • 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

Frequently asked

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.

Sources

  1. Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed bids. The Journal of Finance, 16(1), 8-37. DOI: 10.1111/j.1540-6261.1961.tb02789.x ↗
  2. Krishna, V. (2009). Auction Theory (Second Edition). Academic Press. link ↗

How to cite this page

ScholarGate. (2026, June 3). First-Price Sealed-Bid Auction. ScholarGate. https://scholargate.app/en/game-theory/first-price-auction

Related methods

Bayesian Nash EquilibriumCournot CompetitionStackelberg CompetitionVCG Mechanism

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Bayesian Nash EquilibriumGame Theory↔ compare
  • Cournot CompetitionGame Theory↔ compare
  • Stackelberg CompetitionGame Theory↔ compare
  • VCG MechanismGame Theory↔ compare
Compare side by side →

Referenced by

Bayesian Nash EquilibriumVCG Mechanism

Similar methods

VCG MechanismBayesian Nash EquilibriumPrincipal-Agent ModelStackelberg CompetitionCournot CompetitionNash EquilibriumSubgame Perfect EquilibriumWillingness-to-Pay Estimation

Related reference concepts

AuctionsMechanism DesignEconometrics of Games and AuctionsMarket Structure, Pricing, and DesignAsymmetric and Private Information • Mechanism DesignMarket Design

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — First-Price Auction (First-Price Sealed-Bid Auction). Retrieved 2026-07-21 from https://scholargate.app/en/game-theory/first-price-auction · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
William Vickrey
Subfamily
Game-theoretic
Year
1961
Type
algorithm
Related methods
Bayesian Nash EquilibriumCournot CompetitionStackelberg CompetitionVCG Mechanism
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account