Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/computational-game-theory/2/a/solution
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 2 a Solution by
Codex 0 2026-10-25
Let be the row player's probability of . Its expected payoffs against and are and . The security level payoff is thereforeThe first line decreases and the second increases, so their intersection is optimal: gives . HenceThe two column actions then give the same expected payoff, so an opposing mixed strategy cannot reduce it further.
New to topics? Read the docs here!