Game Theory: Worked Games, Trees and Backward Induction
Practice finding equilibria in payoff matrices, solving sequential games by backward induction, and computing mixed strategies and repeated game thresholds.
Payoffs (row, column): Up/Left (4, 3), Up/Right (1, 1), Down/Left (2, 2), Down/Right (3, 4). Find the pure Nash equilibria.
Tap to flip
Back
(Up, Left) and (Down, Right). Against Left, Row prefers Up (4 > 2); against Right, Row prefers Down (3 > 1). Against Up, Column prefers Left (3 > 1); against Down, Column prefers Right (4 > 2).