In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in … Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the … players enter the coalition. Therefore, we model the communication network by a directed graph and the cooperative game by a …

members of a coalition. We then define a concept of the Core that takes into account these communication possibilities. The …

A new solution is presented for transferable utility games with graph communication where the cooperation possibilities … introduced, under which the value is guaranteed to be an element of the core. For games with complete graph communication the … connected set in the given graph. To determine the payoff for each player, a single-valued solution, the communication tree …

We study cooperative games with communication structure, represented by an undirected graph. Players in the game are …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …

We study cooperative games with communication structure, represented by an undirected graph. Players in the game are …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …

Pongou and Tondji (Pongou and Tondji, Games and Economic Behavior, 108, 206-224, 2018) described an uncertain … solve the problem of valuing inputs in Pongou and Tondji's (2018) environment enriched by a communication structure …

Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We … provide a characterization of the average tree solution for cycle-free graph games. The characterization underlines an … (Myerson, 1977) for cycle-free graph games …

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 …

In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in … Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the … players enter the coalition. Therefore, we model the communication network by a directed graph and the cooperative game by a …

which they usually take different positions. Two examples of such structures are communication networks and hierarchies. In … feasible sets in communication networks and compare them with feasible sets arising from hierarchies …