Two-Person Zero-Sum Strategic Game

For $a \in A$, the associated two-person zero-sum game lets the proponent choose a set containing $a$ and the opponent choose any set. The payoff reflects whether the proponent's set is conflict-free and the attacks between the two sets; the value under optimal play is the strength $\mathsf{s}_F(a)$.