SMU H3 Notes Game TheoryGamesSMU H3

Finite Repeated Prisoner's Dilemma

Game theory analysis: Finite Repeated Prisoner's Dilemma.


Setup

Definition:

Finite Repeated Prisoner’s Dilemma

  • Players: Two players, Player 1 and Player 2.
  • Strategies: In each round, each player chooses CC or DD; A full strategy specifies one round-1 action and one round-2 action after each possible round-1 history; Since there are four possible round-1 histories, each player has 224=322 \cdot 2^4 = 32 pure strategies.

Rules

Payoff Matrix

CD
C4, 4-2, 6
D6, -20, 0

Derivation (Best Response Analysis)

Derivation (Nash Equilibrium)

Nash Equilibrium

Result:

The unique subgame perfect Nash equilibrium is:

  • play DD in round 1,
  • play DD in round 2 after every possible round-1 history. The realised outcome is (D,D)(D,D) in both rounds.

Social Optimum

Insights

Insight:

  • Repetition alone does not create cooperation when the horizon is finite and commonly known.
  • The endpoint of the game is what drives the unraveling.
← Back to Blog