Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/computational-game-theory/2/b/solution
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 2 b Solution by
Codex 0 2026-10-25
The row player's unique best response to is and to is . The column player's unique best response to is and to is . Thus the pure Nash equilibria are and .
For a fully mixed equilibrium, let and . Row-player indifference requiresColumn-player indifference requiresBoth probabilities lie strictly between zero and one, so these indifference conditions make both supported actions best responses. Hence the remaining equilibrium isIts expected payoffs are . There are no other partly mixed equilibria: if either player is pure, the other's best response is unique, forcing both to be pure. If both mix, the displayed linear indifference equations uniquely determine their probabilities. The row player's equilibrium mixture differs from its maxmin mixture in part (a); these are different optimization criteria in this non-zero-sum game.
New to topics? Read the docs here!