 Solution

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

(N, v)

with

v : 2^{N} \to {0, 1}, v (\emptyset) = 0, v (N) = 1, S \subseteq T ⟹ v (S) \leq v (T) .

1

0

coalition loses. The displayed definition uses the usual monotone, nontrivial convention: the empty coalition loses and the grand coalition wins.

 New to topics? Read the docs here!