This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Gale–Shapley theorem | |
|---|---|
| Name | Gale–Shapley theorem |
| Field | Mathematics |
| Subfield | Game theory; John Nash studies; David Gale; Lloyd Shapley |
| First proven | 1962 |
| Notable for | Existence of stable matchings; foundation for matching theory; Nobel Memorial Prize in Economic Sciences relevance |
Gale–Shapley theorem The Gale–Shapley theorem asserts that for any finite instance of the stable marriage problem there exists at least one stable matching and that the deferred acceptance procedure produces such a matching. It underpins major results in Lloyd Shapley's cooperative game theory work and connects to David Gale's combinatorial constructions, contributing to later developments related to John Nash, Alvin Roth, and market-design research at institutions such as Harvard University and Stanford University.
The theorem states: given two disjoint finite sets of equal size with complete preference orderings—originally termed "men" and "women"—there always exists a matching with no pair of agents who prefer each other to their assigned partners. This formulation influenced seminal contributions by Lloyd Shapley and David Gale and relates conceptually to fixed-point results like those of L. J. Savage and John Nash; it also echoes combinatorial themes found in work by Paul Erdős and Richard Rado.
Gale and Shapley proved existence constructively by defining a process now known as deferred acceptance; the proof demonstrates termination, individual rationality, and absence of blocking pairs. The argument uses finiteness akin to techniques used by Andrey Kolmogorov in probabilistic termination and by Bolyai-era combinatorialists; it also leverages ordering properties reminiscent of lattice-theoretic approaches found in Birkhoff's work. The constructive proof yields existence and provides insight into incentive and optimality properties later formalized by researchers at University of Chicago and Massachusetts Institute of Technology.
The Gale–Shapley algorithm proceeds in rounds with proposers and responders: one side proposes in preference order while the other side tentatively accepts best offers and rejects inferior ones. This procedure features prominently in algorithmic analyses by scholars affiliated with Bell Labs, IBM Research, and universities such as Princeton University and Columbia University, and it inspired computational treatments in texts by Donald Knuth and Michael Sipser. Implementations and complexity bounds were refined by researchers at Cornell University and University of California, Berkeley, while applied deployments appear in matching platforms developed at Harvard University and in reforms led by Alvin Roth at national matching programs.
Key properties include proposer-optimality and responder-pessimality: the side making proposals obtains the best possible partners among all stable matchings, while the other side obtains the worst; these formal conclusions were leveraged by economists such as Alvin Roth and mathematicians like Dan Gusfield. The set of stable matchings forms a lattice structure, connecting to lattice theory studied by Garrett Birkhoff, and monotonicity and strategy-proofness results relate to mechanism-design work by Roger Myerson and Eric Maskin. Corollaries include the Rural Hospitals theorem, an existence assertion analogous to ideas in the work of Kenneth Arrow and stability criteria appearing in papers by John Harsanyi.
Generalizations extend to the hospitals/residents problem, many-to-one matchings, and matching with couples; these were studied by researchers at Columbia University, Yale University, and University of Oxford. Other variants incorporate incomplete preference lists, ties, and constraints like diversity or regional quotas—topics pursued by scholars affiliated with Imperial College London and the University of Cambridge. Extensions link to exchange economies and assignment problems treated by Lloyd Shapley and Herbert Scarf, and to algorithmic game theory advances influenced by work at Microsoft Research and Google.
The theorem and algorithm underpin centralized clearinghouses such as national residency match systems shaped by Alvin Roth and institutions like National Resident Matching Program and inspired school assignment reforms in cities like Boston and New York City. Economic market-design implementations draw on insights used in organ-exchange programs studied at Harvard Medical School and allocation platforms developed by teams at Stanford University and MIT. Theoretical implications reach into auction design, coalition formation, and social choice theory, connecting to the research programs of Kenneth Arrow, John Nash, and Amartya Sen and to policy interventions guided by scholars at Princeton University and University of Chicago.
Category:Mathematics Category:Game theory Category:Algorithms