Folk Theorem (Repeated Games)¶

Show that in a sufficiently long, patiently discounted repeated game, almost any mutually acceptable outcome can be held as an equilibrium by credible intertemporal punishment — so repetition both explains cooperation and destroys predictive determinacy.

Core Idea¶

The folk theorem is a family of results establishing that in an infinitely (or indefinitely long) repeated game, any feasible and individually rational payoff — one each player weakly prefers to their minimax — can be sustained as a subgame-perfect Nash equilibrium, provided players are patient enough (discount factor δ near 1). The mechanism is credible intertemporal punishment: cooperation holds because deviation triggers a punishment phase whose discounted cost exceeds the deviation's gain. It has two faces — constructively it explains cooperation one-shot analysis forbids; negatively it explodes the equilibrium set, stripping predictive determinacy.

Scope of Application¶

The theorem lives across game theory, industrial organization, political economy, and contract theory — its substrate strategic optimizers with observable history, shared discounting, and an infinite or indefinite horizon.

Industrial organization — how oligopolists sustain tacit collusion via a price-war punishment phase.
Repeated Prisoner's Dilemma — grounding cooperative equilibria, Axelrod's tournaments and tit-for-tat.
International relations — treaty compliance without a world government via reputation.
Relational contracting — long-running relationships sustaining cooperation where formal contracts are incomplete.
Equilibrium-selection theory — the multiplicity it creates motivates the whole refinement program.

Clarity¶

The theorem makes legible that repetition is not a minor extension but a qualitative change in the equilibrium set, dissolving puzzles — cooperation in the Prisoner's Dilemma, restraint in a commons, treaty compliance — that look intractable in stage-game framing once the discounted future enters the accounting. The practitioner stops asking "how can self-interested players cooperate?" and asks "is δ high enough?" But it also sharpens the cost: predictive determinacy collapses, so a theorist can no longer let "it is a Nash equilibrium" carry an explanation and must name which equilibrium and why.

Manages Complexity¶

The theorem compresses in two opposite directions. Constructively, it collapses the open-ended catalog of cooperation puzzles to one comparison — the deviation's discounted gain against the punishment's discounted cost — often a single threshold inequality on δ, certifying the whole feasible-and-individually-rational region in one stroke. Negatively, it replaces the illusory richness of the repeated-game equilibrium set with one shape (nearly the whole region), so nothing case-specific remains there and the analyst's attention compresses onto the one productive question: which selection principle picks the outcome.

Abstract Reasoning¶

The theorem licenses constructive/predictive reasoning (a threshold test on patience certifying a whole payoff region), diagnostic reasoning (reading sustained cooperation back to a credible punishment mechanism and its load-bearing variables), interventionist reasoning (engineering horizon, observability, and punishment-credibility so cooperation crosses into self-enforcing territory), a negative boundary-drawing inference (the equilibrium set carries no information, so name the selection principle), and substrate boundary-drawing (the proof runs only for strategic optimizers with observable histories, shared discounting, and an infinite horizon).

Knowledge Transfer¶

Within game theory and its applied subfields the theorem transfers as full mechanism — the patience-threshold test, the punishment diagnosis, the design handles, and the equilibrium-selection lesson port intact because the substrate is shared, with subgame perfection and the discount factor travelling with the vocabulary. Beyond it there are two cases: the constructive "shadow of the future" is a genuinely portable parent mechanism (with social_dilemma and coordination_problem_and_equilibrium_selection as relatives) recurring in evolutionary cooperation, reputation, and gift economies; the negative face is a formal result that applies or fails to apply, not a transportable mechanism. Carry the shadow-of-the-future parent, not the theorem's machinery.

Relationships to Other Abstractions¶

Current abstraction Folk Theorem (Repeated Games) Domain-specific

Parents (2) — more general patterns this builds on

Folk Theorem (Repeated Games) is part of, typical Subgame Perfect Equilibrium Domain-specific

The modern repeated-game folk theorem contains subgame perfection as the credibility standard for the punishment strategies sustaining its payoff region.
Folk Theorem (Repeated Games) is a decomposition of Shadow Of The Future Prime

Removing repeated-game proof machinery leaves the shadow-of-the-future mechanism: patient agents use observable future punishment to sustain present restraint.

Children (1) — more specific cases that build on this

Oligopoly Domain-specific presupposes, conditional Folk Theorem (Repeated Games)

Repeated oligopoly analysis presupposes the Folk Theorem when tacitly cooperative prices are sustained by history-conditioned punishment.

Hierarchy paths (4) — routes to 3 parentless roots

Folk Theorem (Repeated Games) → Subgame Perfect Equilibrium → Nash Equilibrium → Equilibrium → Fixed Point

Show alternative paths (3)

Neighborhood in Abstraction Space¶

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

Family — Strategic Interaction & Game Theory (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12