Axiom 1: Be Nice
Never be the first to defect. Nice strategies dominated the top tier of the first tournament.
Axelrod's Iterated Prisoner's Dilemma tournaments, strategies and replicability analysis.
The Prisoner’s Dilemma models the tension between individual self-interest and collective rationality. In a single-round game, mutual defection strictly dominates cooperation. However, when iterated under the "shadow of the future" (discount probability ω), conditional cooperation becomes mathematically sustainable.
Constraint: T > R > P > S and 2R > T + S
Test the fundamental inequality conditions: T Temptation (5), R Reward (3), P Punishment (1), S Sucker (0).
| Player A \ B | Cooperate (C) | Defect (D) |
|---|---|---|
| Cooperate (C) | R, R (3, 3) | S, T (0, 5) |
| Defect (D) | T, S (5, 0) | P, P (1, 1) |
Result: Mutual Cooperation yields 3 points to Player A and 3 points to Player B.
Ensures that defection strictly dominates in a one-shot game. 5 > 3 > 1 > 0 guarantees that defection yields a higher payoff regardless of the opponent's choice.
Prevents players from alternating between exploitation and being exploited. Here, 2(3) = 6 > 5 + 0 = 5. Sustained mutual cooperation yields higher utility than split exploitation.
If the game has a known finite horizon N, players defect on round N. By backward induction, cooperation collapses to move 1. If the end is probabilistic with continuing probability ω, cooperation persists when ω ≥ (T - R)/(T - P).
In population models, the proportion of a strategy grows proportionally to its average payoff relative to the population's mean score. High mutual utility drives ecological dominance.
In 1980, Robert Axelrod invited leading game theorists, economists, and psychologists to submit programmatic algorithms to compete in a 200-round round-robin IPD tournament. Explore all 14 submitted strategies plus the Random baseline below.
Average score across 5 repetitions of 200-round round-robin matches. Winner: Tit For Tat (504 pts).
Never be the first to defect. Nice strategies dominated the top tier of the first tournament.
Retaliate immediately against unprovoked defection to prevent being systematically exploited.
Return to cooperation promptly once the opponent stops defecting to avoid endless echo spirals.
Do not strive to outscore your individual opponent. Victory comes from maximizing mutual pool yield.
Following the publication of Tournament I, Axelrod organized a second tournament with 62 entries from 6 countries. Knowing Tit For Tat's rules, participants engineered aggressive counter-strategies designed to exploit nice programs or trap Tit For Tat.
Ecosystem case study
Submitted by legendary evolutionary biologist John Maynard Smith, Tit For Two Tats (TF2T) requires two consecutive defections before retaliating.
k61r)Author: Danny C. Champion
Complex ratio gauge of opponent responsiveness; reported 2nd place in 1980.
Author: Craig Feathers
Establishes high trust then gradually increases defection frequency to pacify opponent.
Author: David Gladstein
Defects on move 1 to test for provocability. Apologizes if retaliated against, exploits if passive.
Authors: Leyvraz / Borufsen
Heuristic pattern detectors modeling move sequences and history variance.
Authors: Eatherley / Hufford
Reciprocal variants with decaying forgiveness factors tuned to long horizons.
Author: Anatol Rapoport
Identical 4-line entry. Achieved 1st place overall despite aggressive target strategies.
In modern science, empirical findings must be independently reproducible. Modern re-examinations by researchers (Knight, Campbell, Harper, Gaffney, Glynatsi) reveal that Axelrod’s historical experiments suffer from severe replication challenges stemming from lost source code, natural language ambiguities, and legacy Fortran compiler bugs.
Source code lost
The original 1980 source code for Tournament I was lost to history. Researchers attempting to rebuild the algorithms from Axelrod's textual descriptions encountered critical implementation ambiguities:
Code preserved (TourExec1.1.f)
Campbell et al. revived the original 1980s Fortran source code (TourExec1.1.f) and built a modern Python wrapper adapter. While Tit For Tat's overall 1st place victory was verified, major discrepancies surfaced:
k61r), originally reported in 2nd place, dropped precipitously to 12th place due to undocumented edits in preserved code or legacy compiler subroutine evaluation differences.Reported 1980 rank against modern reconstructed-code rank (smooth noise reduction). Tit For Tat: 1st → 4th.
Decades after Axelrod, modern computational capability and game theory proofs completely revolutionized IPD analysis. Tit For Tat is no longer considered globally optimal.
In real-world environments, execution errors occur. If Tit For Tat accidentally defects due to noise (1-5% error rate), an opponent Tit For Tat retaliates. This triggers an infinite "echo" of alternating defections, destroying mutual utility.
Press & Dyson (2012) proved memory-one strategies can unilaterally enforce a linear relation between their score and opponent's score. Extort-2 forces adaptive opponents to cooperate while mathematically guaranteeing the extortionist takes an unfair share.
Shatters Axelrod's axiom that a strategy should "never be envious".
In modern tournaments featuring 250+ entries, high-dimensional Finite State Machines (Evolved_FSM_16) and Hidden Markov Models (HMMs) classify opponents in early moves and execute bespoke optimal counter-strategies.
Relative percentile rank, from the 1980 early naïve era to the modern AI/ZD era: 1st (1980) → 16th (modern, 250+ strategies).
Configure head-to-head IPD matches between classic and modern strategies. Introduce environmental noise (accidental defection rate), adjust round length, and inspect round-by-round decisions and cumulative scores.
Ready
Synthesized from historical archives, Fortran reproductions, and Press-Dyson ZD theory.