The paper first defines at length and then considers a class of n-person games with side-payments in which cooperation among players is communication-wise limited through imposition of certain graph structures. It is shown that there is a unique allocation rule, both efficient and fair, given essentially by the Shapley value of a restricted game. Moreover, if the game is superadditive then the allocation rule is stable.
