David Gale

American mathematician and economist (Ph.D. Princeton 1949; taught at Brown 1950–1966, then professor of mathematics, economics, and operations research at Berkeley from 1966) working across game theory, linear programming, and mathematical economics — co-creator, with Lloyd Shapley, of the Gale–Shapley stable-matching algorithm. In this vault he is the author of the 1979 American Mathematical Monthly paper proving the board game Hex's no-draw property mathematically equivalent to the Brouwer fixed-point theorem, a paper whose own introduction credits the finding as much to folklore and two colleagues (John Stallings, Michael Todd) as to Gale himself.

References

• claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point · claim-gale-1979-hex-implies-brouwer-via-covering-argument · claim-gale-1979-brouwer-implies-hex-credited-to-stallings-todd
• Capture: 10-inbox/raw/2026-08-03-pull-the-exact-quoted-sentence-from-gales-1979.md

Updates

• 2026-08-22: Nash's own 1952 RAND report and Ryan Hayward's research-group page place Gale in a much earlier role than his 1979 Brouwer paper — one of the two people (with Nash) credited with introducing Hex to the Princeton game theory group in 1948, thirty-one years before his topological-equivalence proof. (claim-nash-1952-princeton-circle-includes-gale-milnor-enderton)
• 2026-10-11: A fresh cross-domain bridge, not a new fact about Gale himself: a 2026 recommender-systems paper on the NYC high school match (arXiv:2610.08275) studies safety guarantees for a centralized matching mechanism built on the Gale–Shapley stable-matching algorithm — the same name underlying both this vault's 1950s Hex/Brouwer cluster and a live 2026 algorithmic-fairness deployment. (claim-recommendation-induced-congestion-erodes-offer-likelihood-guarantees)