Max-dominated strategy¶
A game-theoretic strategy that is never a best response to any admissible strategy profile of the other players, even though no single alternative need yield a strictly higher payoff against every profile.
Core Idea¶
A max-dominated strategy is a game-theoretic strategy that is never a best response to any admissible strategy profile of the other players. Every strictly dominated strategy is max-dominated, but max-domination need not have one alternative that is strictly better everywhere. Strict domination implies max-domination, but max-domination can hold without one alternative beating the candidate everywhere. Strict domination implies max-domination, but max-domination can hold without one alternative beating the candidate everywhere.
Scope of Application¶
The concept is used in game theory, strategic-form simplification, rationalizability, mechanism analysis, learning models, dominance solvability, computational game solving, and economic pedagogy. Use it with the player and candidate strategy, complete pure or mixed strategy domains, opponents' admissible profiles, payoff and information structure, best-response correspondence including ties, exact or tolerance-aware calculation, covering alternatives or domination certificate, and any iterative deletion round/order/theorem. Do not infer it from rarity, one belief, never being uniquely best, or strict domination unless the relevant conditions are proved.
- Normal-form games. Checks payoff tables.
- Mixed strategies. May expand profile and dominance sets.
- Rationalizability. Relates to never-best-response deletion.
- Algorithms. Prunes strategy spaces cautiously.
- Mechanism analysis. Identifies choices unsupported by any contingency.
Clarity¶
Report player, game and information structure, candidate strategy, opponents and their admissible pure/mixed profile space, complete payoff function, tie and best-response convention, calculation or optimization method, witness regions/covering alternatives, whether one strict dominator exists, iteration round and deletion order, theorem relating deletion to rationalizability, and numerical tolerances. The closest near miss sets the boundary: Strict domination is nearest: it provides one alternative or mixed strategy that is better throughout, whereas max-domination only requires absence from every best-response set.
Manages Complexity¶
The test compresses an entire opponents' profile space into a supportability verdict while distinguishing a locally changing cover of better replies from one globally dominating alternative. The central pruning–strategic fidelity tradeoff is this: Deletion simplifies a game while changed strategy sets can alter later reasoning. A second pure simplicity–mixed completeness tension matters because Pure profiles are easy to inspect while mixed profiles may change supportability.
Abstract Reasoning¶
Use three linked moves: fix player, strategy sets, payoff, information, and pure/mixed domain; compute the candidate's payoff over every admissible opponents' profile; compute the full best-response correspondence including ties. As a collapse test, the verdict fails when profiles, mixed-strategy allowance, payoff ties, or information structure are changed without recomputation. A fourth check is to certify absence or exhibit a supporting profile.
Knowledge Transfer¶
The never-optimal-under-any-environment pattern transfers to decision pruning, but payoffs, admissible environments, ties, and strategic feedback must be reconstructed rather than copied. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Stronger neighboring comparison requiring exact live-signature review. The correspondence whose empty support defines the concept.
Neighborhood in Abstraction Space¶
Max-dominated strategy sits in a crowded region of the domain-specific corpus (19th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Strategic Games & Equilibrium Concepts (13 abstractions)
Nearest neighbors
- Evaluation function — 0.92
- Dominant Strategy — 0.91
- Strong Nash equilibrium — 0.91
- Correlated equilibrium — 0.91
- Rubinstein bargaining model — 0.91
Computed from structural-signature embeddings · 2026-10-08