Strategy-stealing argument

A nonconstructive game-theoretic proof that a second-player winning strategy would let the first player make a harmless opening move and then adopt that strategy, producing a contradiction.

Version

v1 · 2026-09-08 · History

Domain-specific #

6933

Origin domain

combinatorial game theory

Subdomain

positional games

Core Idea

A strategy-stealing argument proves that the second player cannot force a win by supposing such a strategy exists and showing the first can use it after an extra nonharmful move. Symmetry lets the first player impersonate the second-player role; whenever the stolen strategy calls for the already occupied move, the first uses another legal move, with strategy monotonicity ensuring the extra move does not hurt. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application

Strategy-stealing argument belongs to combinatorial game theory and is useful where the analyst can specify a finite or appropriately terminating symmetric two-player perfect-information game, legal moves, a first-move advantage condition, hypothetical strategies, and a no-draw or outcome convention, then evaluate player symmetry and the harmless-extra-move property are proved, and termination or outcome assumptions justify converting 'second cannot force a win' into the stated conclusion. The scope is broad within that domain but bounded by the need for player symmetry and the harmless-extra-move property are proved, and termination or outcome assumptions justify converting 'second cannot force a win' into the stated conclusion. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making player symmetry and the harmless-extra-move property are proved, and termination or outcome assumptions justify converting 'second cannot force a win' into the stated conclusion the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Strategy-stealing argument can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Strategy-stealing argument. Strategy-stealing argument compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: a finite or appropriately terminating symmetric two-player perfect-information game, legal moves, a first-move advantage condition, hypothetical strategies, and a no-draw or outcome convention. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express player symmetry and the harmless-extra-move property are proved, and termination or outcome assumptions justify converting 'second cannot force a win' into the stated conclusion independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of combinatorial game theory because they reuse a finite or appropriately terminating symmetric two-player perfect-information game, legal moves, a first-move advantage condition, hypothetical strategies, and a no-draw or outcome convention, Symmetry lets the first player impersonate the second-player role; whenever the stolen strategy calls for the already occupied move, the first uses another legal move, with strategy monotonicity ensuring the extra move does not hurt., and type the carrier, state every parameter and convention in the definition, test that player symmetry and the harmless-extra-move property are proved, and termination or outcome assumptions justify converting 'second cannot force a win' into the stated conclusion, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Strategy-stealing argument Domain-specific

Parents (1) — more general patterns this builds on

• Strategy-stealing argument is a kind of Proof By Contradiction Prime

  The proposed strict upward parent is prime:proof_by_contradiction.

Hierarchy paths (2) — routes to 2 parentless roots

• Strategy-stealing argument → Proof By Contradiction → Deductive Reasoning

Show alternative path (1)

Neighborhood in Abstraction Space

Strategy-stealing argument sits in a crowded region of the domain-specific corpus (39^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Strategic Games & Temporal Logic (8 abstractions)

Nearest neighbors

• Non-cooperative game theory — 0.90
• Nash equilibrium computation — 0.90
• Markov strategy — 0.90
• Rationalizable strategy — 0.89
• One-shot deviation principle — 0.89

Computed from structural-signature embeddings · 2026-09-08