Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/computational-game-theory/1/e/solution
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 1 e Solution by
Codex 0 2026-10-25
Both players can guarantee by part (d), so at any Nash equilibrium each must receive at least . Their payoffs sum to , forcing both equilibrium payoffs to equal .
Moreover, an equilibrium action must itself have the maxmin guarantee . If a player's chosen action allowed an opposing response that reduced its payoff below , that response would give the opponent more than , a profitable unilateral deviation. Thus both equilibrium sites belong to the central set identified in part (d).
Conversely, if both choose from that central set, each chosen action guarantees . Neither can improve above , because the other player's fixed central action still guarantees the other player . Consequently, all pure Nash equilibria areFor even , this includes both co-located central profiles and both orders of the two distinct central sites.
New to topics? Read the docs here!