models of communication and hierarchy restrictions in cooperative games, compare different network structures with each other … illustrate these network structures by applying them to cooperative games with restricted cooperation. …

It is known that peer group games are a special class of games with a permission structure. However, peer group games … are also a special class of (weighted) digraph games. To be specific, they are digraph games in which the digraph is the … transitive closure of a rooted tree. In this paper we first argue that some known results on solutions for peer group games hold …

We introduce an Owen-type value for games with two-level communication structures, being structures where the players … Aumann-Dreze value for games with coalition structures, the Myerson value for communication graph games and the equal surplus …

In the literature various models of games with restricted cooperation can be found. In those models, instead of … games based on the idea of the Average Tree value for cycle-free communication graph games. We provide two axiomatizations …

cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions to … every TU-game. In the literature various models of games with restricted cooperation can be found. So, instead of allowing …) are given for games on union closed systems. …

cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff … distribution to every TU-game. A well-known solution is the Shapley value. In the literature various models of games with … solutions or rules for these games that generalize the Shapley value: one is obtained as the conjunctive permission value using …

We introduce an efficient solution for games with communication graph structures and show that it is characterized by …

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division …