Solution

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

Under the intended positive rewards , a hunter at the all-hare strategy profile receives . A unilateral switch to deer leaves only one participant. Since the integer threshold satisfies with , we have , so that deer hunt fails and pays zero. Thus no player can gain by switching, and the all-hare profile is a Nash equilibrium. At it remains an equilibrium through indifference; negative would invalidate the claim.

New to topics? Read the docs here!