There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

Given any α ∈ [0, 1], an α-constant-sum game on a finite set of players, N, is a function that assigns a real number to any coalition S ⊆ N, such that the sum of the worth of the coalition S and the worth of its complementary coalition N\S is α times of the worth of the grand coalition....