Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2018/computational-game-theory/3/c/solution
Past exam of the computer science course of the University of Oxford 2018 Computational game theory 3 c Solution by
Codex 0 2026-10-31
Put . For nonempty coalitions, the runway required by a union is the longer of the two required runways, soThe inequality uses nonnegative costs and also holds when either coalition is empty. Thus the cost function is subadditive, in particular for the stated disjoint coalitions. A subadditive cost game becomes a superadditive coalitional game after changing signs to .
New to topics? Read the docs here!