Chainstore paradox¶
The conflict between backward-induction accommodation and reputation-based deterrence in a finitely repeated entry game with sequential challengers.
Core Idea¶
The paradox depends on complete information finite horizon and sequential rationality, reputation effects can reappear under incomplete information or bounded rationality and fighting can be credible in altered payoff or commitment structures. At the final market an incumbent prefers accommodating entry to costly fighting; backward induction repeats this choice through every earlier market, yet intuitive strategic reasoning suggests an early fight could deter later entrants. 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¶
Chainstore paradox belongs to game theory and is useful where the analyst can specify the typed game theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the incumbent chain store and sequence of potential entrants and markets, finite known horizon, entry and stay-out choices, fight or accommodate response, payoffs and information, stage-game dominance, backward-induction subgame-perfect equilibrium, proposed deterrence reputation and its lack of credibility, incomplete-information resolution and distinction from commitment games are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the incumbent chain store and sequence of potential entrants and markets, finite known horizon, entry and stay-out choices, fight or accommodate response, payoffs and information, stage-game dominance, backward-induction subgame-perfect equilibrium, proposed deterrence reputation and its lack of credibility, incomplete-information resolution and distinction from commitment games are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
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 Chainstore paradox. Chainstore paradox 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¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed game theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the incumbent chain store and sequence of potential entrants and markets, finite known horizon, entry and stay-out choices, fight or accommodate response, payoffs and information, stage-game dominance, backward-induction subgame-perfect equilibrium, proposed deterrence reputation and its lack of credibility, incomplete-information resolution and distinction from commitment games are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of game theory because they reuse the typed game theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, At the final market an incumbent prefers accommodating entry to costly fighting; backward induction repeats this choice through every earlier market, yet intuitive strategic reasoning suggests an early fight could deter later entrants., and type the carrier, state every parameter and convention in the definition, test that the incumbent chain store and sequence of potential entrants and markets, finite known horizon, entry and stay-out choices, fight or accommodate response, payoffs and information, stage-game dominance, backward-induction subgame-perfect equilibrium, proposed deterrence reputation and its lack of credibility, incomplete-information resolution and distinction from commitment games are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Chainstore paradox Domain-specific
Parents (1) — more general patterns this builds on
-
Chainstore paradox is a kind of Recursion Prime
The proposed strict upward parent is
prime:recursion.
Hierarchy path (1) — routes to 1 parentless root
- Chainstore paradox → Recursion
Neighborhood in Abstraction Space¶
Chainstore paradox sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Non-cooperative game theory — 0.92
- Game form — 0.90
- Move by nature — 0.90
- Mean-field game theory — 0.90
- Outcome (game theory) — 0.90
Computed from structural-signature embeddings · 2026-09-08