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

Auction Formats and Revenue Equivalence

Research Depth 103 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
557prerequisites beneath it
See this on the map →
Nash EquilibriumVickrey-Clarke-Groves (VCG) Mechanisms→→Auction TheoryFirst-Price Sealed-Bid Auction
auctions mechanism-design bidding

Core Idea

Standard auction formats include English (ascending price), Dutch (descending price), sealed-bid first-price, and sealed-bid second-price. Under symmetric bidder assumptions, these formats generate equal expected revenue (revenue equivalence theorem). Different formats induce different bidding behavior and have different strategic implications.

Explainer

From Nash equilibrium, you know how to find stable strategy profiles where no player wants to deviate. Auctions are a natural and high-stakes application: each bidder must decide how much to bid, knowing that others are making the same calculation. The four standard auction formats each create a different strategic environment, yet under certain conditions they produce surprisingly similar outcomes.

In an English auction (ascending price), the auctioneer starts low and raises the price until only one bidder remains. Your dominant strategy is simple: stay in until the price exceeds your valuation, then drop out. You never need to guess what others will bid — you just react to the rising price. The winner is the bidder with the highest valuation, and they pay approximately the second-highest valuation (the price at which the last competitor dropped out). A sealed-bid second-price auction (also called a Vickrey auction) reaches the same outcome through a different mechanism: each bidder submits one sealed bid, the highest bid wins, but the winner pays the *second*-highest bid. Here, bidding your true valuation is a weakly dominant strategy — you cannot do better by shading your bid up or down. These two formats are strategically equivalent: both lead to truthful revelation and payment equal to the second-highest value.

The Dutch auction (descending price) starts high and drops until someone claims the item. This is strategically identical to a sealed-bid first-price auction: in both cases, you must commit to a price without knowing others' bids, and if you win, you pay exactly what you bid. The optimal strategy involves bid shading — bidding below your true valuation to capture some surplus, balanced against the risk of losing to a slightly higher bid. How much you shade depends on the number of competitors and what you believe about the distribution of their valuations. More competitors means less shading, because the risk of being outbid rises.

The revenue equivalence theorem is the unifying result. It states that under four conditions — bidders are risk-neutral, symmetric (values drawn from the same distribution), the bidder with the highest value wins, and the bidder with the lowest possible value pays nothing — all four auction formats generate the same expected revenue for the seller. This is remarkable because the formats look so different: some involve truthful bidding, others strategic shading; some are dynamic, others static. The theorem shows that these surface differences wash out in expectation. The intuition is that what determines revenue is the underlying distribution of values and the number of bidders, not the specific rules of the game. Revenue equivalence breaks down when its assumptions fail — when bidders are risk-averse (favoring first-price auctions, which generate more revenue), when values are correlated (the "winner's curse" becomes relevant), or when bidders are asymmetric. These violations are precisely why auction design matters in practice and why governments and firms invest heavily in choosing the right format for spectrum sales, procurement, and online advertising.

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 → The Revelation Principle → Vickrey-Clarke-Groves (VCG) Mechanisms → Auction Formats and Revenue Equivalence

Longest path: 104 steps · 557 total prerequisite topics

Prerequisites (2)

Leads To (2)