Skip to content

Grim Trigger

A repeated-game strategy that cooperates every period until the opponent defects once, then switches to permanent defection forever — the severity-maximal, zero-forgiveness deterrent that sustains cooperation whenever the discount factor is high enough.

Version
v4 · 2026-09-28 · History
Domain-specific #
471
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Game Theory, Repeated Games Strategies → Mathematics

Core Idea

A grim-trigger strategy prescribes cooperation every period in an infinitely repeated game until the opponent defects even once, at which point it switches to permanent defection with no return. Its two-state structure is minimal: an indefinite cooperative phase and an absorbing punishment phase. Deterrence works through the shadow of the future — when the discount factor δ is high enough, the foregone infinite cooperative stream outweighs the one-period temptation, making cooperation subgame-perfect. It is the starkest instance of the folk theorem.

How would you explain it like I'm…

One Strike, Never Again

Two friends share toys every single day. One friend's rule is: 'I'll keep sharing forever, but if you ever grab my toy even once, I will never share with you again.' Because of that rule, grabbing isn't worth it, but one accidental grab ruins the sharing forever.

Cheat Once, Lose Forever

Grim Trigger is a plan for a game played over and over with no set end. You cooperate every round, but the moment the other player cheats even once, you stop cooperating forever with no second chances. Cheating might win a little right away, but it would cost all the rewards of future cooperation, so a player who cares about the future won't cheat. The weakness is that one mistake or misunderstanding ruins the friendship permanently. That's why people also study gentler plans, like tit-for-tat, that forgive.

Permanent-Punishment Cooperation Strategy

In the prisoner's dilemma, played once, each player gains by betraying ('defecting'). Grim Trigger is a strategy for the infinitely repeated version: cooperate every round until the opponent defects once, then defect forever. It has just two states, cooperation and a punishment state you can never leave. If players value the future enough, the short-term gain from defecting is smaller than the endless stream of cooperative rewards they'd lose, so cooperation becomes stable. The catch is extreme fragility: a single error or misread signal locks both players into permanent punishment, which is why forgiving strategies like tit-for-tat are compared against it.

 

Grim Trigger is a strategy in infinitely repeated games that cooperates in every period until the opponent defects once, then defects permanently. Its automaton is minimal: a cooperative state and an absorbing punishment state. In a one-shot prisoner's dilemma, defection dominates because the immediate gain outweighs any same-period retaliation. In the repeated game, defection's one-period gain must be weighed against the discounted infinite stream of cooperative payoffs it forfeits. For a sufficiently high discount factor δ, relative to the temptation and punishment payoffs, cooperation's present value exceeds that of defecting and being punished forever, making mutual cooperation a subgame-perfect Nash equilibrium. This is the simplest instance of the folk theorem, where the 'shadow of the future' sustains cooperation. Its maximal severity gives the strongest deterrent but makes it completely fragile to noise: one mistaken observation or accidental deviation triggers irreversible mutual punishment. Forgiving alternatives like tit-for-tat, generous tit-for-tat and win-stay-lose-shift are studied against it as the severity-maximal benchmark.

Scope of Application

Grim trigger lives across the repeated-games and strategic-interaction subfields wherever an effectively-infinite repeated interaction carries a defection temptation — within that one substrate of agents who can defect, observe, and punish.

  • Repeated-games theory — the home turf; the canonical folk-theorem proof construction.
  • International relations and arms control — mutual assured destruction and massive retaliation.
  • Industrial organization and antitrust — grim-trigger collusion and trigger-price analysis of cartels.
  • Protocol and reputation design — permanent-blacklist schemes and session-aborting cryptographic protocols.
  • The strategy family — the zero-forgiveness corner against which tit-for-tat and its kin define themselves.

Clarity

Naming grim trigger gives the theorist a fixed reference point: the severity-maximal corner, from which every gentler strategy is located by how it deviates. It isolates in purest form the single quantity that makes cooperation possible — the shadow of the future — and reduces the equilibrium condition to one inequality in δ. The sharper question becomes not "can cooperation be sustained?" but "how much forgiveness can a scheme afford while still deterring?" It also separates a threat's strength from its credibility.

Manages Complexity

Repeated play opens an unmanageable space of history-dependent strategies. Grim trigger compresses the question to two states, one transition, one absorbing terminus, and a single discount-factor inequality — nothing else in the history matters once the state is known. It also organizes the rest of the strategy space by sitting at a fixed extremal corner, so every gentler strategy is a measured departure along the forgiveness axis. The analyst tracks just two quantities: the shadow of the future and the degree of forgiveness.

Abstract Reasoning

Grim trigger licenses interventionist reasoning — setting δ and reading off whether cooperation holds, with its threshold the easiest to clear. It supports diagnostic reasoning that infers the binding constraint from the threat's structure and separates punishment strength from credibility, boundary-drawing that locates any strategy as a departure from the zero-forgiveness corner and flags when grim is the wrong tool under noise, and predictive reasoning that forecasts collapse as irreversible once triggered.

Knowledge Transfer

Within game theory grim trigger transfers intact as mechanism wherever an effectively-infinite repeated interaction with a defection temptation exists — MAD, cartel collusion, blacklist protocols are genuine deployments, not analogies, each a real infinitely-repeated game. Absent an agent choosing whether to defect, the precondition simply fails. Loose one-strike policies with no shadow-of-the-future calculation are analogy. The general "credible absorbing punishment sustains cooperation" lesson travels via Credible Commitment, Deterrence, Punishment (psychology), and the Folk Theorem (Repeated Games) family.

Relationships to Other Abstractions

Local relationship map for Grim TriggerParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Grim TriggerDOMAINPrime abstraction: Shadow Of The Future — is a decomposition ofShadow OfThe FuturePRIMEPrime abstraction: Game-Theoretic Strategy — is a kind ofGame-TheoreticStrategyPRIME

Current abstraction Grim Trigger Domain-specific

Parents (2) — outgoing typed relations

  • Grim Trigger is a kind of Game-Theoretic Strategy Prime

    Grim trigger is a game-theoretic strategy specialized to a two-state history rule: cooperate until one defection, then defect forever.

  • Grim Trigger is a decomposition of Shadow Of The Future Prime

    Stripping the absorbing trigger rule leaves a visible, sufficiently weighted future that makes the discounted cost of retaliation exceed present defection gain.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

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

Family — Game-Theoretic Models & Paradoxes (38 abstractions)

Nearest neighbors

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