Mechanism Design

Designing the rules of a game so that equilibrium behavior yields desired outcomes.

Ask the Game theory assistant 1 min read · Updated September 9, 2026

Definition

A mechanism is $(M,g)$ with message space $M=\prod M_i$ and outcome function $g:M\to X$ . It implements social choice function $f$ in equilibrium concept $\sigma$ if $g(\sigma^*(\theta))=f(\theta)$ for all type profiles $\theta$ .

Goals typically include efficiency, budget balance, individual rationality, and incentive compatibility.

Intuition

Design the rules backwards from the outcome you want.

Anticipate strategic play and shape incentives so truthfulness or efficiency emerges.

Worked example

The VCG mechanism implements efficient allocation in dominant strategies.

Optimal auctions (Myerson) maximize expected revenue subject to Bayesian incentive compatibility.

The math

Revelation Principle: any outcome implementable by some mechanism is implementable by a direct, incentive-compatible mechanism $f:\Theta\to X$ .

Myerson-Satterthwaite impossibility: no mechanism for bilateral trade is simultaneously efficient, individually rational, budget-balanced, and Bayesian incentive-compatible.

Where it is used

Spectrum auctions, matching markets (kidney exchange, school choice), online ad auctions, and procurement.

Central in algorithmic mechanism design and EC theory.

Go deeper

More in Game theory

Assembled from the ReLU.chat curated knowledge base. These explanations are concise on purpose; check the sources for anything important.