Axelrod's Iterative Prisoner's Dilemma
The Prisoner's Dilemma
  • Each prisoner chooses Cooperate (C) or Defect (D).
  • Defection gives a higher short-term reward.
  • Repeated interactions can make cooperation worthwhile.
Axelrod's Tournament
  • This simulator recreates Robert Axelrod's famous 1980 Iterative Prisoner's Dilemma tournament.
  • Select 10 strategies and run your own tournament.
  • Compare scores to discover which strategies succeed over time.
The Big Question
Who wins: the selfish, the forgiving, or the cooperative?
Payoff Points
🤝 C × C
+3 / +3 pts
Mutual trust
😇 C × D
+0 / +5 pts
Sucker's payoff
😈 D × C
+5 / +0 pts
Temptation
💀 D × D
+1 / +1 pts
Mutual punishment
Stage 1: Understanding Strategies in Prisoner's Dilemma
Strategy Definition
Compare Strategies — Live Preview
Select Strategies
Use dropdown to select strategy
Vs
Rounds:
Strategy A Score
Strategy B Score
Select two strategies and click Live Preview
Nice Nasty
Selected: 0 / 10
Stage 2: Tournament Mode — Iterative Prisoner's Dilemma
Number of Rounds
Match Results
Run Tournament to see results
Points Table — Round by Round
Round 0 / 0
Pos. Prev. Strategy Tournament Points Pts #Wins
Run Tournament to start
Tournament Analysis
Run Tournament to see insights