Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/computational-game-theory/1/f/solution
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 1 f Solution by
Codex 0 2026-10-25
There is no pure Nash equilibrium. If the firms choose different sites, serves at least its own building, so receives less than . By moving onto 's site, makes every customer equidistant from the two shops and wins every tie, obtaining . Thus any separated profile has a profitable unilateral deviation by .
At any co-located profile, receives zero. It can move to a different site and capture at least that site's customers, obtaining at least two. Thus every co-located profile also has a profitable unilateral deviation. These cases exhaust all pure strategy profiles.
New to topics? Read the docs here!