Inheritance of properties in communication situations

In this paper we consider cooperative games in which the possibilities for cooperation between the players are restricted because communication between the players is restricted. The bilateral communication possibilities are modeled by means of a (communication) graph. We are interested in how the communication restrictions influence the game. In particular, we investigate what conditions on the communication graph guarantee that certain appealing properties of the original game are inherited by the graph-restricted game, the game that arises once the communication restrictions are taken into account. We study inheritance of the following properties: average convexity, inclusion of the Shapley value in the core, inclusion of the Shapley values of a game and all its subgames in the corresponding cores, existence of a population monotonic allocation scheme, and the property that the extended Shapley value is a population monotonic allocation scheme.