A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Auction Design: First-Price and Second-Price Sealed-Bid Auctions

Research Depth 102 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
556prerequisites beneath it
See this on the map →
Mechanism Design: Strategic ImplementationIndividual Rationality (Participation Constraint)→→First-Price Sealed-Bid AuctionSecond-Price Sealed-Bid Auction (Vickrey Auction)
auction-theory mechanism-design

Core Idea

In second-price (Vickrey) auctions, the winner pays the second-highest bid and truth-telling is dominant. In first-price auctions, the winner pays their own bid, inducing bid-shading below true value. The Revenue Equivalence Theorem shows these formats generate the same expected revenue under independent private values. Strategic incentives differ fundamentally between formats.

Explainer

Consider selling a painting through a sealed-bid auction. Each bidder privately writes down a number and submits it. The highest bidder wins. The question is: how much does the winner pay? This single design choice — the payment rule — fundamentally changes how rational bidders behave, even though the information structure and allocation rule (highest bid wins) are identical.

In a second-price sealed-bid auction (also called a Vickrey auction), the winner pays the *second-highest* bid, not their own. This creates a remarkable strategic property: truth-telling is a dominant strategy. To see why, suppose your true value for the painting is $500. If you bid $500 and win, you pay whatever the second-highest bidder submitted — say $350 — and pocket $150 in surplus. Could you do better by bidding $600? You win in exactly the same cases (your bid only matters for whether you win, not what you pay), so overbidding gains nothing. Could you do better by bidding $400? You might lose to someone who bid $450, forfeiting a deal that would have given you $50 in surplus. Underbidding can only hurt you. The dominant strategy is to bid exactly your value, regardless of what others do. This is why the Vickrey auction is central to mechanism design — it achieves efficient allocation (the highest-value bidder always wins) through a simple incentive structure.

In a first-price sealed-bid auction, the winner pays their own bid. Now truth-telling is disastrous: if you bid your true value and win, your surplus is zero. Every rational bidder shades their bid below their true value, trading a lower probability of winning for positive surplus when they do win. The optimal amount of shading depends on your beliefs about competitors' values. With *n* bidders whose values are independently drawn from a uniform distribution on [0, 1], the symmetric equilibrium strategy is to bid (n−1)/n times your true value. With 2 bidders, you bid half your value; with 10, you bid nine-tenths. More competition means less shading, because the risk of losing to a close rival outweighs the benefit of a larger surplus.

The Revenue Equivalence Theorem delivers a surprising punchline: under independent private values with risk-neutral bidders, the seller's expected revenue is the same in both formats. In the second-price auction, winners pay less (the second-highest value), but they bid their true values. In the first-price auction, winners pay more (their own bid), but they shade below their true values. These effects offset exactly. The theorem extends far beyond these two formats — it applies to any auction that allocates the good to the highest-value bidder and gives zero surplus to a bidder with the lowest possible value. Revenue equivalence does break down with risk aversion (first-price generates more revenue because bidders shade less to avoid losing), correlated values, or asymmetric bidders, which is why auction design in practice — from spectrum licenses to online advertising — requires careful attention to the specific environment.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → One-Sided Limits → Continuity Definition → Limits and Continuity in Multiple Variables → Functions of Several Variables → Continuity in Multiple Variables → Partial Derivatives: Definition and Computation → Differentiability in Multiple Variables → Differentiability in Multivariable Functions → Total Differential and Linear Approximation → Chain Rule for Multivariable Functions → Implicit Differentiation → Related Rates → Optimization Problems → Critical Points of Multivariable Functions → Critical Points and Classification of Extrema → Second Partial Test for Local Extrema (Hessian) → The Hessian Matrix and Second Derivative Test → Unconstrained Optimization: Finding Extrema → Optimization in Multiple Variables → Lagrange Multipliers → Constrained Optimization and Lagrange Multipliers → Utility and Preferences → Marginal Utility and Diminishing Returns → Profit Maximization → Perfect Competition → Shutdown and Breakeven Decisions → Monopoly → Monopolistic Competition → Oligopoly and Strategic Behavior → Game Theory Basics → Nash Equilibrium → Bayesian Games (Games of Incomplete Information) → Mechanism Design: Strategic Implementation → Individual Rationality (Participation Constraint) → Auction Design: First-Price and Second-Price Sealed-Bid Auctions

Longest path: 103 steps · 556 total prerequisite topics

Prerequisites (2)

Leads To (2)