Chainstore paradox¶

The conflict between backward-induction accommodation and reputation-based deterrence in a finitely repeated entry game with sequential challengers.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3643
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Game Theory → Mathematics
Aliases: Chain-store paradox

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.

How would you explain it like I'm…

The Scare-or-Share Puzzle

A big store has shops in many towns. New stores ask to open, one town at a time. The big store can fight a new store, which costs a lot, or share the town. Thinking backward from the last town, sharing always seems smarter, so it should never fight. But it also seems like fighting early might scare later stores away. That puzzle is the chain-store paradox.

The Tough-Reputation Puzzle

Picture a big chain store with shops in many towns. One by one, a new company thinks about opening in each town. If a newcomer opens, the chain store can fight with big price cuts that cost it money, or just share the town. In the last town, fighting has no future benefit, so the chain store would share. Knowing that, in the second-to-last town fighting doesn't scare anyone, so it would share there too—and this backward reasoning says it should never fight at all. But common sense says fighting early could build a tough reputation and scare later newcomers away. The clash between those two ideas is the paradox.

Reputation Versus Backward Induction

The chainstore paradox is a game-theory puzzle. An incumbent chain store faces a known, finite sequence of potential entrants in different markets. Each entrant chooses to enter or stay out, and after entry the incumbent chooses to fight, which is costly, or accommodate. In any single market, accommodating is better for the incumbent. Using backward induction from the last market, where there's no future to protect, accommodating wins in every market, so the only subgame-perfect outcome is never fighting and everyone entering. Yet intuitively, fighting early to build a reputation seems smart, but under full information and a known end that threat isn't credible. The paradox depends on these assumptions; with uncertainty about the incumbent's type, limited rationality, or different payoffs or commitments, fighting can become credible again.

The chainstore paradox concerns an incumbent chain store and a finite, commonly known sequence of potential entrants, one per market. Each entrant chooses entry or staying out; after entry, the incumbent chooses to fight, which is costly, or to accommodate. In the stage game accommodating dominates fighting for the incumbent. By backward induction, the incumbent accommodates in the final market; since nothing can be gained later, the same holds in the penultimate market and so on, so the unique subgame-perfect equilibrium has every entrant entering and the incumbent always accommodating. Intuitive strategic reasoning suggests an early fight could build a deterrent reputation, but under complete information, a finite horizon, and sequential rationality, such reputation-based deterrence is not credible. The paradox is resolved by relaxing assumptions: incomplete information about the incumbent's type, or bounded rationality, lets reputation effects reappear, and altered payoffs or commitment devices can make fighting credible. It should be kept distinct from commitment games, where the incumbent can bind itself in advance.

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.
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) — outgoing typed relations

Chainstore paradox is a kind of Recursion Prime

It remains its own entry because its identity is fixed by 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.

Hierarchy path (1) — routes to 1 parentless root

Chainstore paradox → is a kind of Recursion

Neighborhood in Abstraction Space¶

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

Family — Cooperative Game Theory & Power Indices (12 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25