Why Threats Work: The Neural Economics of Cooperation

Finding Solved Games in Moving Castles.

Update — 15 August 2026. The Horizon-Collapse Linter has graduated to a free, fully interactive public playground: nonxerosum.studio/mechanism-horizon-collapse-linter. Since this issue shipped, the tool was hardened and canonicalised on the exact CLI printed below — its browser version is a byte-checked port of the same math — and rebuilt so you can set the rounds, the discount factor, and the visible endpoints and watch the collapse round move live. The studio's worked example reproduces there in one click. Paid subscribers had it first; this is the 30-day graduation under the studio's tool-graduation policy.

A cooperation threat is simple. I will punish you if you defect. The moment that sentence hits the table in a negotiation, a game starts underneath it. If punishment is credible, I defect less because the threat pins me down. If punishment is not credible, I defect as much as I want because you cannot afford to carry it out. A credible threat pins cooperation in place. An uncredible threat is expensive talk, and I ignore it.

The Folk Theorem, the foundational result in repeated-game theory, rested on this for thirty years. It proved that in an infinitely repeated game, any individually rational outcome can be an equilibrium, sustained by punishment threats, as long as the shadow of the future is long enough. The shadow is the discount factor, the weight players give to future payoffs versus now. Long shadow means future payoffs matter. You threaten defection consequences severe enough to make defection not worth it today. The threat credibility rests on a hidden assumption: that the game is infinite, or at least long enough that you have the patience to follow through. The moment the shadow breaks, the moment a player sees the end in sight, the threat collapses.

This quarter, that hidden assumption surfaced. Not in a theory paper, but in three places: a neuroscience lab that measured the neural substrate of betrayal, a mechanism-design result that formalises when visible game-ends wreck cooperation, and our own design table, where the coordination mechanic for an unlaunched 4X game the studio is designing was found to carry the same unexamined assumption about infinity that the Folk Theorem bundled into a parenthesis thirty years ago. We found it before anyone played it. That is the only reason this issue exists.

Here is the chain that closes it. Folk Theorem proves cooperation needs credible punishment. Punishment credibility rests on the shadow of the future, the discount factor applied to what happens next. The shadow collapses the moment a game-end is visible. A visible game-end is what the studio calls Loyalty, a time horizon you can see and count down against. And betrayal is not a loss, it is a neural event that bypasses loss aversion entirely, firing a distinct circuit so compulsive that punishment becomes automatic, not optional. That circuit is what makes the threat actually stick, and the moment the horizon ends, that circuit stops firing back. Threats work because betrayal is neurological, not rational. And the moment the game-end is visible, the neurology stops working.

The studio has skin in this, and it is worth being precise about which kind. The studio is designing a 4X game that has not launched, and its season-end auction window is a visible game-end: the season is the game, the window is the hard cutoff when trading stops and the game settles. It sits on the calendar from round one, countable by every player. The game has not launched. Nobody has played a round. What we have is the config, and a tool that reads it. The tool says that at a textbook payoff ratio the mechanism stops being sustainable at round 7, one round before the window, and that exactly where it breaks depends on payoffs nobody has published. This issue's tool is that tool: it tells you where your cooperation mechanism is about to die because the game-end is about to become visible. We pointed it at ourselves first, and it found something. The prediction is published here, before the game ships, so that you can check it against us later.

Five from the wave. One sentence each. Cited, read through the mechanism.

1. The Folk Theorem as the foundation: Fudenberg and Maskin (1986), "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," proves that in an infinitely repeated game, any individually rational outcome can be sustained as a perfect equilibrium via trigger-strategy punishment, as long as the discount factor is high enough (shadow of the future is long enough), which means the Folk Theorem assumes an infinite or indefinitely long game and does not address what happens when the endpoint becomes visible.
2. The Shadow of the Future as the load-bearing assumption: Axelrod (1984), "The Evolution of Cooperation," empirically grounds iterated Prisoner's Dilemma and demonstrates that tit-for-tat succeeds when the shadow of the future is long enough for retaliation to be worth believing; Luce and Raiffa (1957) and Selten (1978) give the complementary result, that the moment the endpoint becomes visible, cooperation unravels backward from it. Axelrod shows the indefinite-game success; the finite-game collapse is theirs, not his.
3. Finite-horizon collapse as a known failure mode: Luce and Raiffa (1957), "Games and Decisions," set out the backward-induction argument for the finitely repeated Prisoner's Dilemma, and Selten (1978), "The Chain Store Paradox," shows how far it reaches: because the last round is played with no threat of punishment, defection unravels backwards through the game, making the Folk Theorem's infinite-game result inapplicable the moment the endpoint is visible. CORRECTION, 2026-10-16: an earlier version of this issue attributed that result to Benoit and Krishna (1985), "Finitely Repeated Games." That was wrong, and close to backwards — their paper shows that when the stage game has more than one equilibrium, cooperative outcomes can be sustained under finite repetition.
4. Betrayal Aversion as a distinct neural process: recent neuroscience (Aimone, Houser, and Weber, 2014, "Neural signatures of betrayal aversion: an fMRI study of trust," measuring anterior insula activation distinct from loss aversion; and Tang, Tan, Gao, Lin, Gan, Ding and Gao, 2026, "Betrayal is worse than loss during cooperation," bioRxiv 2026.03.04.709582, which dissociates the two: betrayal is encoded early in the decision, indexed by the P3, while loss aversion surfaces later in the LPP, and betrayal aversion suppresses cooperation more strongly than loss aversion does) identifies a neural substrate distinct from loss aversion or rational calculation, a circuit that activates specifically in response to betrayal and that drives punishment and cooperation enforcement with an automaticity that rational incentive structures alone do not produce.
5. Studio case: an unreleased game's auction window as a visible game-end (design-time prediction, not play data): The studio's game is pre-launch, so there are no players, no Season 1 and no observed defection; instead the linter is run against the Season 1 config (8 rounds, discount factor 0.85, a season-end auction visible from round 1, no rolling horizons). It returns no verdict, and that is the honest answer: where cooperation breaks depends on the game's payoffs, those are not public, and naming a single round without them would be false precision. What it returns instead is the whole shape: the collapse round for every possible ratio of temptation to punishment. At a ratio near 1, which is what a textbook prisoner's dilemma gives, cooperation stops being sustainable from round 7. Below about 0.85 only the final round fails, which is true of every finite game ever played. That conditional prediction is still falsifiable, and it is published before the game ships (studio design analysis, 2026, not play data). (Corrected 13 November 2026: an earlier version of this passage named round 7 flatly, against a threshold of 0.9 it called the Folk Theorem's. The Folk Theorem has no such constant; its bar comes from the payoffs. The quantity being compared also grew toward the endpoint instead of shrinking, which made the final round the only one that appeared safe. Both are fixed, in the tool and here.)

Shipping with this issue: The Horizon-Collapse Linter, built on Python standard library. Point it at any coordination mechanism with a time horizon, and it detects when that horizon becomes visible to players, then flags the Folk Theorem failure mode and recommends overlapping or rolling horizons to keep the shadow long. The full tool and its install sit below, after The Read.

The mechanism: when the game-end is visible, cooperation dies

The Folk Theorem is not a description of what happens. It is a theorem, a proof. It says: in an infinitely repeated game, you can sustain cooperation via threat, because the threat is credible. The credibility rests entirely on one thing: a player believes the game will continue long enough that punishment today is worse than honesty today. That belief is the shadow of the future, the discount factor applied to what comes next. The moment that shadow breaks, the threat loses credibility and cooperation stops being a rational choice.

Backward induction (Luce and Raiffa, 1957; Selten, 1978) shows exactly how. Start at the last round. In the last round, there is no future, no threat of punishment, no shadow. A rational player defects in the last round. Now move back to round n-1. In round n-1, you know that everyone will defect in round n no matter what you do, so your action now cannot change future payoffs. Why not defect now too. Move back again. By induction, cooperation unravels from the endpoint backward through the entire game, and a finite game collapses to single-round defection equilibrium, the same result as a one-shot game.

The Folk Theorem does not address this because the Folk Theorem assumes the game never ends. In an infinite game, there is no last round to start backward induction from. The shadow is infinite. Threats are always credible because future punishment is infinitely important relative to today's defection gain. The moment a game-end becomes visible, the shadow shrinks to a finite number of rounds, and cooperation collapses exactly as backward induction predicts.

The studio's own case illustrates this, and it is worth being exact about what kind of case it is. The studio's game has not launched. There is no Season 1, no players, no observed defection. What exists is a rulebook (eight rounds, discount factor 0.85, a season-end auction window visible from round one, no rolling horizons) and a tool that reads it.

Run the linter below on that config and it returns:

Horizon-Collapse Linter -- Example 4X game, Season 1
Discount factor: 0.85
Model: continuation-value (grim trigger); NOT strict backward induction
Required ratio: UNKNOWN -- no payoffs supplied
Continuation value of an endless game at this discount factor: 5.6667

[NO VERDICT] season_end_auction (round 8)
  Collapse round: NOT REPORTED -- no payoffs were supplied, and any single
                  round would be false precision.
  No payoffs supplied, so there is no threshold to compare against and NO collapse round is reported. The sensitivity table below gives the collapse round for every possible temptation-to-punishment ratio.
  Sensitivity -- the collapse round for each possible required ratio:
    ratio above 0.0      up to 0.85     -> collapse from round 8
    ratio above 0.85     up to 1.5725   -> collapse from round 7
    ratio above 1.5725   up to 2.1866   -> collapse from round 6
    ratio above 2.1866   up to 2.7086   -> collapse from round 5
    ratio above 2.7086   up to 3.1523   -> collapse from round 4
    ratio above 3.1523   up to 3.5295   -> collapse from round 3
    ratio above 3.5295   up to 3.8501   -> collapse from round 2
    ratio above 3.8501   and above      -> collapse from round 1
  Recommendation: Supply payoffs as {"T":..,"R":..,"P":..} to get a round number. Without them any single round would be false precision.

Caveats this tool cannot settle for you:
  - If the stage game has more than one equilibrium, finite-horizon cooperation can be sustained and this flag is not warranted; a time structure cannot show that.
  - Verify that 'discount_factor' is players' time preference or continuation probability, not a designer's resource-decay parameter. If it is the latter, this whole analysis is a category error.

VERDICT: NO VERDICT -- no payoffs supplied, so no collapse round is reported; see the sensitivity table above

This is a prediction about a game nobody has played yet, derived from the game's own parameters, and it is conditional, because one parameter is missing. At round 7, with one round left, the value of everything still to come is 0.850 of a round's payoff. Whether that is enough depends on what a player gains by defecting against what they lose by being punished, and that ratio comes from the payoff matrix. At a ratio near 1 it is not enough, and cooperation unravels from round 7. The final round fails whatever the payoffs are, because nothing follows it: the value of the future there is exactly zero. Not because players are wicked, but because the season-end auction window was announced at the start, visible to all, and the final rounds are therefore finite. The threat "I will retaliate next round" stops being a threat in round 8 if there is no round 9.

We publish the prediction before the game ships, so that when it ships you can check whether we were right. That is the only version of this claim we are entitled to make.

The fix is not to hide the endpoint. The fix is to break the endpoint into overlapping or rolling horizons. A season that is eight rounds but carries reputation and alliance relationships that extend past the season-end into the next season has a longer effective discount factor than the calendar suggests. The visible endpoint of season 1 is not the same as the visible endpoint of the game if season 2 is already trading and reputation matters. You make the horizon roll, and the threat credibility stays.

That is the entire mechanism. Visible game-end, finite shadow, cooperation collapse, backward induction unravels from the endpoint. Fix by extending the effective horizon past the visible endpoint.

The Folk Theorem assumed infinity was obvious. One season-end auction window made infinity a line on a calendar. (Corrected 13 November 2026: this issue named an unreleased game by its internal working title. The name has been removed.)

The Horizon-Collapse Linter

Bernard-layered. Anchored on Instructor (~13k stars, MIT): point it at a prose rulebook with --from-rulebook and Instructor returns a Pydantic-validated GameConfig, which the linter then reads. The default JSON path is stdlib-only, offline, and imports nothing.

The Read built the argument. The linter is the argument made executable: point it at your game's time structure (seasons, rounds, auction windows, vesting schedules, agent task loops, any coordination mechanic with a visible end) and it enumerates the horizons, flags which ones are about to become finite and visible to rational agents, and recommends rolling or overlapping structures to keep the shadow credible. The full source and how to run it sit below.

The Horizon Collapse Linter, in full. The mechanism above explains why cooperation dies when the game end becomes visible. The linter red-teams the time structure you actually wrote and names the round where it collapses. Available now to Pro subscribers.

Founder offer

The free tier carries the Tape and the Read in full, every week, including the mechanism and the studio's own failure case above. The linter's full source, the Brief, and the Feed sit behind the paywall, which is where the studio discloses its running costs honestly. Pro is $15 / mo or $250 / yr. Founder is $300 / yr, capped at one hundred seats, and the founders-only MCP server is not live yet; it goes live once all one hundred are taken. If you ship a game or a coordination mechanism with a visible horizon, the linter pays for itself before the first player sees the endpoint. No pitch beyond that. The mechanism is the argument.