Prices for things like electricity or mobile-phone spectrum are often set in auctions. Because of the “winner’s curse,” the highest bidder can actually end up losing money when true value is uncertain. Wilson built a theory showing how bidders shade their bids downward in common-value settings to avoid this curse. Milgrom extended the analysis to cases with both common and private values and proved that sharing more information can raise final prices and efficiency. Together they created the Simultaneous Multiple Round Auction (SMRA), allowing governments to sell many spectrum licenses at once. The format has generated tens of billions of dollars for the U.S. Treasury alone and helped expand modern communication networks.

Auction theory belongs to the branch of game theory dealing with incomplete information; bidders form Bayesian beliefs about rivals and choose strategies accordingly. Wilson (1969, 1977) analyzed first-price auctions under a pure common-value model, introducing the revenue equivalence (RE) condition and deriving equilibrium bid shading for risk-neutral players. Milgrom and Weber (1982) proposed the affiliated-values model and proved the linkage principle, showing how auction rules that reveal more information raise expected seller revenue. Their FCC-targeted SMRA combines ascending-clock and sealed-bid elements, enabling price discovery and information aggregation while accounting for license complementarities. Subsequent designs—such as the Combinatorial Clock Auction (CCA) and the Incentive Auction—led by Milgrom employ integer-programming and price-vector update rules to solve NP-hard assignment problems within practical time frames. These mechanisms now allocate public resources, clear electricity wholesale markets, and trade greenhouse-gas allowances, helping establish auction design as an empirical, policy-relevant discipline.

Wilson analyzed a symmetric risk-neutral first-price auction with common values where bidders condition on private signals; the Bayesian–Nash equilibrium bid function b(s_{(1)}) = E[V | s_{(1)}] − ∫_{0}^{s_{(1)}}F^{n-1}(t) dt / F^{n-1}(s_{(1)}) quantifies bid shading to offset winner’s-curse exposure. Milgrom and Weber’s linkage principle, assuming affiliated signals, establishes a weak revenue ranking among mechanisms increasing information disclosure. The SMRA, a hybrid ascending-clock/ sealed-bid format, employs an activity rule to deter tacit collusion while provisional allocations are tracked through standing high bids. The CCA integrates a price clock with depth-constrained branch-and-bound, using VCG-based payments to approximate incentive compatibility under complementarity. The Incentive Auction couples a reverse and a forward auction, effectively endogenizing the supply curve to repurpose TV spectrum. These designs have become canonical references for mechanism design in multi-unit, complementary, and asymmetric-information settings, with ongoing refinements in telecommunications, energy, and environmental markets.