 Solution

ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/computational-game-theory/1/c/solution

Yes to both questions, for both players. Site one is strictly dominated by site two. Against opposing site

y

u (2, y) - u (1, y) = {k - 2, 1, y = 1 or 2, 3 \leq y \leq k .

Every difference is positive for

k \geq 4

. By reflection, site

k

k - 1

. These endpoint actions are therefore also weakly dominated strategies, since strict dominance is stronger than the requirement of being no worse everywhere and better somewhere.

 New to topics? Read the docs here!