Mechanism Design & Auction Theory

The 2020 Nobel in Economics went jointly to Paul Milgrom and Robert Wilson of Stanford for the auction theory and practical formats they had built since 1994 — the FCC spectrum auctions that by then had raised over $200 billion for the US Treasury while laying the institutional foundation for the mobile-telecommunications industry. Spectrum allocation had stalled in the 1980s because licenses are not independent goods: a national carrier needs adjacent regional licenses across different frequency bands, with competitors' moves on every license mattering simultaneously. Milgrom's simultaneous multiple-round auction (1994) let bidders adjust across lots in successive rounds, discovering prices and resolving complementarities iteratively.

Mechanism design is reverse game theory: conventional game theory takes the rules as given and asks what strategic agents do; mechanism design takes the desired outcome — efficient allocation, revenue maximization, fair matching — as given and asks what rules will produce it under strategic play. The foundational results cluster in the 1960s–70s. William Vickrey's 1961 paper introduced the second-price sealed-bid auction and proved its central theorem: bidding your true valuation is dominant because the winner pays the second-highest bid, so your bid only determines whether you win. Vickrey won the 1996 Nobel and died three days later. Leonid Hurwicz framed incentive compatibility — when can a mechanism induce truthful revelation of private information? — and Eric Maskin's implementation theory plus Roger Myerson's revenue equivalence theorem (under mild conditions, all auctions yield the same expected revenue) completed the foundations. The trio shared the 2007 Nobel. The Vickrey-Clarke-Groves mechanism extends Vickrey to multi-item allocation by charging each participant the externality they impose on others — elegant in theory, vulnerable to collusion and computationally hard in practice. Robert Wilson's common-value work analyzed the winner's curse (the winner is by definition the most optimistic bidder, whose estimate on average exceeds true value) and argued for detail-free designs that don't depend on knowing the bidder distribution.

Matching markets handle allocation where prices are absent. Lloyd Shapley and David Gale's 1962 deferred acceptance algorithm always terminates in a stable matching and is strategy-proof for the proposing side. Alvin Roth spent four decades applying it: the US medical-residency match, school choice (Boston, NYC, Denver, Chicago), and most consequentially kidney-exchange chains that turn incompatible donor-recipient pairs into transplants. Roth and Shapley shared the 2012 Nobel.