Myerson–Satterthwaite

Myerson–Satterthwaite
Name	Myerson–Satterthwaite theorem
Field	Game theory, Mechanism design, Welfare economics
Proved	1983
Authors	Roger B. Myerson, Mark A. Satterthwaite
Related	Arrow's impossibility theorem, Gibbard–Satterthwaite theorem, Revelation principle

Myerson–Satterthwaite is a fundamental impossibility result in Game theory and Mechanism design that shows bilateral trade between a buyer and a seller with private valuations cannot achieve all of efficiency, incentive compatibility, individual rationality, and budget balance simultaneously when valuations overlap. The theorem, proved by Roger B. Myerson and Mark A. Satterthwaite in 1983, connects to longstanding concerns in Welfare economics and complements results such as Arrow's impossibility theorem and the Gibbard–Satterthwaite theorem. It has influenced literature on auctions, bargaining, and market design studied at institutions like Stanford University, Massachusetts Institute of Technology, and Harvard University.

Background

The problem arises from a simple trade setting inspired by classical models in Welfare economics and bargaining theory influenced by work from Kenneth Arrow, John Hicks, Paul Samuelson, and L. J. Savage. Early formalizations of private information and mechanism design developed by Leonid Hurwicz, Incentive compatibility pioneers and later synthesized by William Vickrey and Roger Myerson led to characterization questions also treated by John Nash in bargaining and by Harold Hotelling in markets. Myerson and Satterthwaite built on literature including results by H. Peyton Young and Robert Aumann to show a sharp limitation for bilateral exchange between agents modeled as in the work of Milton Friedman and Frank Ramsey.

Model and Assumptions

The canonical model posits two risk-neutral agents, a seller and a buyer, with private valuations drawn from continuous independent distributions; this setup echoes frameworks used by William Vickrey, Lloyd Shapley, John Harsanyi, and Kenneth Arrow. The seller's valuation and the buyer's valuation are random variables with overlapping supports, as in related analyses by Roger Myerson and Eric Maskin, and agents report types to a mechanism as in the Revelation principle developed by G. J. Stigler and Leonid Hurwicz. The mechanism must satisfy incentive compatibility (truthful reporting), individual rationality (voluntary participation), and budget balance (no external subsidies), concepts operationalized in work by Robert B. Wilson and Paul Milgrom.

Main Impossibility Theorem

Myerson and Satterthwaite prove that no mechanism can simultaneously achieve ex post efficiency, Bayesian incentive compatibility, individual rationality, and ex post budget balance when the buyer's and seller's valuation distributions have overlapping support; the statement parallels impossibility themes found in Arrow's impossibility theorem and the Gibbard–Satterthwaite theorem while addressing bilateral exchange like models of John Nash bargaining. The theorem formalizes that there exists a region of types where any truthful, voluntary, and budget-balanced mechanism must sometimes fail to trade even when trade would increase total surplus, an insight related to constraints studied by Eric Maskin and Timothy Besley.

Proof Sketch and Intuition

The proof uses incentive-compatibility constraints and revenue-equivalence style arguments introduced by Roger Myerson and builds on virtual surplus ideas from Paul Milgrom and Robert Wilson. By assuming truthfulness and individual rationality, one derives inequalities that link transfer payments to reported types similar to techniques in Laffont–Tirole style principal–agent models and results by John Bulkley and Jean Tirole. Comparing expected gains from trade across overlapping supports yields a contradiction with budget balance; the combinatorial logic echoes impossibility proofs by Kenneth Arrow and strategic-manipulation arguments of Mark Satterthwaite's earlier work.

Extensions and Related Results

Subsequent literature extended the theorem to multi-unit exchange, risk-averse agents, correlation between types, and interdependent values explored by Paul Milgrom, Robert Wilson, Itai Ashlagi, and Alvin E. Roth. Results connect to optimal mechanism design in settings studied by Tim Roughgarden, Vasilis Syrgkanis, and Inbal Talgam-Cohen, and to impossibility or approximation results such as the budget-balanced approximations of Camerer and implementations studied by Abraham Neyman and Ehud Kalai. Mechanisms that relax one requirement—allowing deficits, subsidies, or weak budget balance—have been characterized by authors like Tomer Blumenson and Rakesh Vohra.

Applications and Implications

The theorem informs design of institutions including double-auction formats at exchanges like New York Stock Exchange and mechanism choices in market platforms studied at eBay and Google's ad exchanges, influencing policy analyses at Federal Trade Commission and European Commission where trade frictions and private information matter. It motivates approximate and randomized mechanisms in electronic markets developed by Paul Milgrom and practitioners at NASDAQ and affects bargaining protocols in labor markets, matching markets researched by Alvin E. Roth and Lloyd Shapley. The Myerson–Satterthwaite result thus underpins both theoretical limits and practical design trade-offs considered by academics and regulators at National Bureau of Economic Research and leading universities.

Category:Mechanism design