LATEX VERIFIED PROOFS
๐Ÿ“ PROBABILITY & STATS

Game Theory & Nash Equilibrium: Prisoner Dilemma & Strategy

Understand Game Theory fundamentals, Prisoner's Dilemma, Dominant Strategies, Nash Equilibrium, and payoff matrices with real-world examples.

PS
Dr. Maya Patel โ€ข SolveCalc Math Lab
Sept 2026 Edition
โฑ 5 min read
๐ŸŽ“ High School & College Prep
โœ“

Executive Summary: The Science of Strategy

Game theory is the formal mathematical study of conflict and cooperation between rational decision-makers:

01 // DOMINANT STRATEGY

A strategy that yields a strictly higher payoff than any alternative, regardless of what other players choose to do.

02 // NASH EQUILIBRIUM

A state where no player can unilaterally improve their individual payoff by switching strategies while others hold steady.

03 // MINIMAX THEOREM

In two-player zero-sum games, minimizing your maximum possible loss is mathematically identical to maximizing your minimum gain.

In classical optimization, you solve for the best choice in a passive environment: how to minimize fuel consumption given wind resistance, or how to maximize corporate revenue given fixed manufacturing costs. The wind and the factory do not try to outsmart you.

In Game Theory, the environment consists of other active, intelligent agents who are simultaneously trying to optimize their own outcomes at your expense. Pioneered by John von Neumann and expanded by Nobel laureate John Nash, game theory transformed economics, geopolitical diplomacy, cybersecurity, and biology.

ยง 01 DEFINITIONS

What is Game Theory? Strategic Interdependence & Rational Agents

Formally, a mathematical game consists of three components:

  • Players $N = {1, 2, ..., n}$: The decision-makers.
  • Action Sets $S_i$: The full universe of strategies available to player i.
  • Payoff Functions $u_i(s_1, s_2, ..., s_n)$: The utility reward assigned to player i given the combined choices of all players.
ยง 02 THE CLASSIC DILEMMA

The Prisoner's Dilemma: Payoff Matrix & Dominant Strategies

Two suspects are arrested and interrogated in separate rooms:

Player 1 Player 2 Cooperate (Silent) Defect (Confess)
Cooperate (Silent) (-1, -1)  [1 year each] (-5, 0)  [5 yrs vs Free]
Defect (Confess) (0, -5)  [Free vs 5 yrs] (-3, -3)  [3 years each]

The Paradox: If both cooperate, they serve only 1 year each (-1, -1). But for Player 1, confessing yields 0 instead of -1 (if P2 stays silent), and 3 years instead of 5 (if P2 confesses). Defecting is a strictly dominant strategy for both players.

Rational individual self-interest leads both players to the suboptimal equilibrium (-3, -3)!

ยง 03 NASH EQUILIBRIUM

Nash Equilibrium: Pure vs Mixed Strategy Profiles

A strategy profile $(s_1^*, s_2^*, ..., s_n^*)$ is a Nash Equilibrium if for all players i:

u_i(s_i^*, s_{-i}^*) ge u_i(s_i, s_{-i}^*) quad orall s_i in S_i

John Nash proved in 1950 that every finite game has at least one equilibrium, provided players are permitted to play mixed strategies (randomizing actions according to a probability distribution, like bluffing in poker or choosing Rock-Paper-Scissors with 1/3 probability each).

ยง 04 ZERO-SUM GAMES

Zero-Sum Games & Von Neumann's Minimax Theorem

In a zero-sum game, one player's gain is exactly equal to the other player's loss: $u_1 + u_2 = 0$ (like Chess, Go, or Poker).

Von Neumann's Minimax Theorem guarantees:

max_{p} min_{q} p^T A q = min_{q} max_{p} p^T A q = V

This value V is called the game value. This principle forms the core decision loop of modern Chess engines like Stockfish!

ยง 05 REAL-WORLD IMPACT

Real-World Applications: Economics, Auctions, and Evolutionary Biology

  • Google Ad Auctions: Uses Generalized Second-Price (GSP) auctions where bidding your true private valuation is a dominant Nash strategy.
  • Evolutionary Biology (John Maynard Smith): Explains animal territorial aggression via the Hawk-Dove game and Evolutionarily Stable Strategies (ESS).
  • OPEC Oil Cartels: Explains why member states face constant temptation to cheat on oil output quotas (a multi-player Prisoner's dilemma).

โ“ Game Theory FAQs

How does Tit-for-Tat solve the Prisoner's Dilemma in repeated games? โ–ผ

In Robert Axelrod's famous computer tournaments, the simple program Tit-for-Tat won consistently: (1) Start by cooperating, (2) thereafter, simply copy whatever the opponent did in the previous turn. By punishing defection immediately and forgiving immediately, it fosters sustainable long-term cooperation!

๐Ÿ’ก

SolveCalc Pedagogical Insight

BRAESS'S PARADOX

Can building a new highway make traffic congestion worse?

Yes! In 1968, mathematician Dietrich Braess showed that adding extra capacity to a traffic network can cause drivers seeking individual Nash equilibrium paths to congest the new route, increasing average commute time for every single person on the road!

๐Ÿ“š Related Math Guides & Masterclasses

๐Ÿ“„ Printable Exam Cheatsheet

Download the Probability & Statistics Cheat Sheet (PDF)

Free, laminated-style reference summary with high-yield formulas, step-by-step rules, and exam shortcuts.