- Content map: SMU H3 Game Theory Map
Setup
Definition:
Stag Hunt Game
- Players: Hunter 1 and Hunter 2.
- Strategies: Each hunter chooses Stag or Hare.
- Rules: Players move simultaneously; coordinating on Stag reaches the payoff-dominant outcome.
Payoff Matrix
| Stag | Hare | |
|---|---|---|
| Stag | 5, 5 | 0, 3 |
| Hare | 3, 0 | 4, 4 |
Derivation (Best Response Analysis)
- If Hunter 2 chooses Stag, Hunter 1 compares with , so .
- If Hunter 2 chooses Hare, Hunter 1 compares with , so .
- By symmetry, and .
- Mutual best responses occur at (Stag,Stag) and (Hare,Hare).
Nash Equilibrium
Result:
The pure-strategy Nash equilibria are:
Social Optimum
- Total payoff at (Stag,Stag) is .
- Total payoff at (Hare,Hare) is .
- (Stag,Stag) is socially optimal and Pareto-dominates (Hare,Hare).
Insights
Insight:
- Stag is payoff-dominant because it gives both players .
- With a belief on each action by the other hunter:
- Hare is risk-dominant because it gives the higher expected payoff under equal uncertainty.
- The game separates efficiency from safety.