Unanimity game
= Unanimity game
{title2=$u_K(S)=\mathbf1_{\{K\subseteq S\}}$}
For a fixed nonempty <coalition> $K$, the <simple cooperative game> in which a <coalition> wins exactly when it contains $K$. Members of $K$ are exactly the <veto players>. It is a <convex cooperative game>: intersections of <winning coalitions> still contain $K$, and checking the remaining zero-one cases establishes the <supermodular> inequality. Full <symmetry of players in a cooperative game> forces $K=N$.