Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2020/computational-game-theory/1/b/solution
Past exam of the computer science course of the University of Oxford 2020 Computational game theory 1 b Solution by
Codex 0 2026-10-25
A weakly dominant strategy must be a best response to either opponent action. For X this requiresThe first is stronger because . ThusFor Y the comparisons are and , givingBelow each upper endpoint the corresponding strategy is strictly better against both opponent actions; at the endpoint one comparison ties and the other is strict. Thus the answers also satisfy the convention that weak dominance requires a strict advantage somewhere. Since expected payoffs are linear in the opponent's mixing probability, checking both opponent pure strategies suffices for every opponent mixed strategy.
New to topics? Read the docs here!