── ── Mental model

Non-Zero-Sum

A non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but feel zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat…

How it works

Five steps producing a Non-Zero-Sum Analysis. Stop rule: If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.

1. Map positions vs. underlying interests. Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses. 2. Construct the payoff matrix. Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum. 3. Assess the shadow of the future. Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round? 4. Identify the cooperation mechanism. (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure. 5. Design the first move. Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.

When to use it

• someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'
• a negotiation or conflict feels deadlocked
• you're designing a platform, contract, or institution that needs to align competing parties

Worked example

Axelrod's Computer Tournament (1980)

Primary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in The Evolution of Cooperation (1984).