Solution

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

Put . For nonempty coalitions, the runway required by a union is the longer of the two required runways, so
The 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!