Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2020/computational-game-theory/1/e/solution
Past exam of the computer science course of the University of Oxford 2020 Computational game theory 1 e Solution by
Codex 0 2026-10-25
Neither asymmetric purchase outcome is a Nash equilibrium for any permitted . At , X's chosen purchase requires , but Y's chosen nonpurchase, against X buying, requires . These requirements are incompatible because .
At , Y's chosen purchase requires , whereas X's nonpurchase against a buying Y requires . Again the inequalities are incompatible. Thus every Nash equilibrium in pure strategies has both players taking the same action; the conclusion is stronger than merely observing symmetry in their available actions, since their original market shares differ.
New to topics? Read the docs here!