Game Theory – Module 3

Non-Zero-Sum Games

Nash Equilibrium • Pareto Efficiency • Social Dilemmas • Coordination Problems

Define Payoff Matrix

Example 1 – Prisoner's Dilemma
Two suspects: stay silent (cooperate) or confess (defect)?
Confessing is dominant but leads to the worst joint outcome.
2×2 · dominant strategy · social dilemma
Example 2 – Coordination Game
Two firms choose an industry standard. A market only exists if both choose the same one.
2×2 · two Nash equilibria · coordination problem
Example 3 – Price Negotiation
Buyer and seller negotiate over high or low price. If they agree, both gain.
3×3 · multiple Nash equilibria · Pareto analysis
Rows (↓) = Strategies of  |  Columns (→) = Strategies of  |  Cell = (Payoff P1, Payoff P2)