Can you design the rules so honesty is the winning move?
Topic 23 keeps one decision-maker but gives them several objectives that genuinely conflict, so “optimal” stops being a point and becomes a curve. Game theory (topics 11 to 15) drops the other assumption: when another party is also choosing in response to you, your best plan depends on theirs and there is no single answer to compute, only an equilibrium to find. It underwrites markets that clear through auctions, security proofs written as games between an adversary and a defender, and populations that settle into stable mixes of strategy.
Every topic so far in this module analyses a game whose rules are already fixed. Mechanism design runs the logic backwards: choose the rules so that self-interested play produces the outcome you actually want. It is game theory used as an engineering discipline rather than a diagnostic one.
The clearest example is an auction where honesty just wins. In a first-price sealed-bid auction, bidding your true value is a mistake. You should bid below it, since you pay whatever you bid. That forces everyone into a guessing game about everyone else's guesses. A second-price (Vickrey) auction removes the guessing entirely: the highest bidder wins but pays the second-highest bid, not their own. Suddenly there is no reason to shade your bid at all: bidding your honest value is always at least as good as any alternative, whatever anyone else does.
That property has a name, strategy-proofness, or incentive compatibility, and it is the central design goal of the whole field: build a mechanism where the strategically smart move and the honest move are the same move, so nobody has to out-think anybody else to get a good outcome.
Claim. In a second-price sealed-bid auction, bidding your true value v is a weakly dominant strategy: at least as good as any other bid b, against any bids from opponents.
Proof. Let m be the highest bid among your opponents. Compare bidding v against any other b:
if m < v: bidding v wins, profit = v − m > 0.
bidding b < m loses, profit = 0, strictly worse.
any winning b gives the same profit v − m, no better.
if m > v: bidding v loses, profit = 0.
bidding b > m wins but pays m > v, profit < 0: strictly worse.
if m = v: every choice ties at profit 0.
In every case, truthful bidding is never beaten and is sometimes strictly better: the definition of weak dominance. Nothing about the other bidders' strategies enters the argument, which is exactly what makes it strategy-proof: it works whether opponents are rational, irrational, or colluding. (Vickrey, 1961; generalised to multi-item settings as the Vickrey–Clarke–Groves mechanism.)
The honest caveat: strategy-proofness is not free. The revenue-equivalence theorem shows first-price and second-price auctions yield the same expected revenue under standard assumptions: the seller is not sacrificing money for honesty, but neither format is a free lunch over the other, and real auctions add reserve prices, budget limits and collusion risk that break the clean theory in specific, well-studied ways.
Selling public airwaves Government spectrum auctions are mechanism design at national scale: badly designed auctions have historically left billions of dollars unclaimed or handed licenses to the wrong bidders. The FCC's 2017 broadcast incentive auction: a two-sided design (reverse auction to buy spectrum back from broadcasters, forward auction to sell it to carriers): raised $19.8 billion, with just over $10 billion paid to broadcasters and more than $7 billion going to the U.S. Treasury. Paul Milgrom and Robert Wilson won the 2020 Nobel Memorial Prize in Economic Sciences "for improvements to auction theory and inventions of new auction formats," work whose formats are now used for spectrum, electricity and airport landing slots worldwide. (William Vickrey himself won the Nobel in 1996, three days after his death, for the theory the field still starts from.)
Check yourself
In a second-price sealed-bid auction, what should you bid?
Truthful bidding is weakly dominant whatever the others do, which is the point of strategy-proof design. (Shading below your value is the first-price auction's problem.)