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...

In this paper we model the formation of directed communication networks. A directed communication network is represented by a directed graph. Firstly, we study an allocation rule satisfying two appealing properties, component efficiency and directed fairness. We show that such an allocation rule...

In this paper we study inheritance properties of average convexity in communication situations. We show that the underlying graph ensures that the graphrestricted game originating from an average convex game is average convex if and only if every subgraph associated with a component of the...