Glicksberg's theorem¶
A continuous zero-sum game result guaranteeing equality of maximin and minimax expected payoff over Borel mixed strategies on compact Hausdorff strategy spaces under the stated semicontinuity condition.
Core Idea¶
Glicksberg's theorem extends minimax reasoning to certain continuous zero-sum games. Each player's pure strategies lie in a compact Hausdorff space, mixed strategies are Borel probability measures, and expected payoff is obtained by integrating the payoff function over both measures. Under the theorem's semicontinuity condition, the supremum of one player's guaranteed payoff equals the infimum of the other's worst-case bound, so the game has a mixed-strategy value.
Scope of Application¶
Use the theorem only after matching every topological, measure, payoff, and zero-sum hypothesis to the stated version. Use the theorem only after matching every topological, measure, payoff, and zero-sum hypothesis to the stated version.
- Continuous games. Establishes a value beyond finite matrices.
- Mixed strategies. Uses probability measures over compact spaces.
- Minimax analysis. Equates guaranteed expected payoffs.
- Economic models. Handles continuous action sets when assumptions hold.
- Counterexamples. Shows why discontinuity matters.
Clarity¶
The equation is a conclusion about optimized expected payoffs, not a pointwise interchange of sup and inf. The order of quantifiers and the passage from pure points to measures must remain visible. The closest near miss sets the boundary: Von Neumann's minimax theorem is closest: it covers finite or convex settings under different hypotheses, while Glicksberg addresses compact topological strategy spaces with measure-valued mixing.
Manages Complexity¶
Topology, integration, optimization, and strategic opposition meet in one result. Compactness controls escape, semicontinuity controls limits, and mixing supplies convexity-like structure; dropping one can invalidate the equality. The central general strategy spaces–strong regularity tradeoff is this: The theorem broadens actions beyond finite sets while retaining compactness and semicontinuity. A second pure discontinuity–mixed convexification tension matters because Randomization helps but cannot repair every payoff pathology.
Abstract Reasoning¶
Use three linked moves: verify zero-sum payoff orientation; check both pure-strategy spaces for compact Hausdorff structure; match the exact upper or lower semicontinuity version. As a collapse test, the case exits when a required topological or regularity assumption fails or when the game is not zero-sum. A fourth check is to define Borel probability measures and the expected payoff integral.
Knowledge Transfer¶
The hypothesis-audit pattern transfers to existence theorems. The conclusion does not transfer to discontinuous, noncompact, non-zero-sum, or differently measurable games without a separate theorem. The nearest stopping boundary is explicit: Von Neumann's minimax theorem is closest: it covers finite or convex settings under different hypotheses, while Glicksberg addresses compact topological strategy spaces with measure-valued mixing. The inclusion test remains: A theorem application qualifies when the game is zero-sum, pure-strategy spaces meet the compact Hausdorff hypothesis, payoff has the required semicontinuity, and mixed payoffs use Borel measures. The structure no longer applies when the case exits when a required topological or regularity assumption fails or when the game is not zero-sum. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. The conclusion equates opposed guaranteed bounds.
Relationships to Other Abstractions¶
Current abstraction Glicksberg's theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Glicksberg's theorem is a kind of Minimax Theorem Domain-specific
Glicksberg's theorem is a named member of the minimax theorem family, extending it to continuous games on compact Hausdorff strategy spaces.
Hierarchy path (1) — routes to 1 parentless root
- Glicksberg's theorem → Minimax Theorem → Minimax Strategy → Optimization
Neighborhood in Abstraction Space¶
Glicksberg's theorem sits in a crowded region of the domain-specific corpus (35th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Game-Theoretic Models & Paradoxes (37 abstractions)
Nearest neighbors
- Mixed Strategy Equilibrium — 0.90
- Matching pennies — 0.88
- Bayesian Nash Equilibrium — 0.88
- Rubinstein bargaining model — 0.88
- Cognitive Hierarchy Theory — 0.88
Computed from structural-signature embeddings · 2026-10-08