The Prisoner's Dilemma ⚖️

The Scenario

Two gang members are arrested and separated. The police lack enough evidence to convict them on the principal charge but have enough to convict both on a lesser charge. Each prisoner is offered a deal.

The Payoff Matrix

This grid shows the sentence for each combination of choices. The goal is to minimize your own sentence.

Prisoner B's Choice
Cooperate (Silent) Defect (Testify)
Your
Choice		 Cooperate (Silent) You: 1 Year
B: 1 Year		 You: 10 Years
B: 0 Years
Defect (Testify) You: 0 Years
B: 10 Years		 You: 5 Years
B: 5 Years

Play the Game! (5 Rounds)

You are Prisoner A. Make your choice. The computer (Prisoner B) will choose randomly.

Your Total Sentence: 0 years | PC's Total Sentence: 0 years

Game History

Total Served shows the cumulative prison sentence for each player over all rounds.

Round You PC Round Sentence Your Total Served PC's Total Served Combined Total Served

Conclusion: Key Lessons

The Prisoner's Dilemma is more than a game; it illustrates key principles of strategy and trust. Based on analysis from the Library of Economics and Liberty, here are five takeaways:

  1. Future Consequences Matter: Cooperation is more likely when players value future payoffs. If the immediate reward for betrayal is too tempting (i.e., a player is "impatient"), cooperation breaks down.
  2. Cheating Must Be Detectable: For cooperation to work, betrayal must be observable and punishable. It's easier to maintain cooperation in small, stable groups where actions can be monitored.
  3. "Tit for Tat" is a Powerful Strategy: A simple but effective strategy is to cooperate on the first move and then mirror your opponent's previous move. This encourages cooperation but can also lead to cycles of retaliation if a move is misinterpreted.
  4. A Known End-Point Undermines Cooperation: If players know when the game will end, the incentive to betray increases as the final round approaches. Logically, since you would betray on the last round, you might as well betray on the second-to-last, and so on.
  5. A Dominant Leader Can Enforce Cooperation: In some scenarios, a single large player may have such a strong interest in stability that they will cooperate even if they know smaller players will cheat. They absorb the loss to prevent a total collapse of the system.
← Back to Game Theory Playground