In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games … can be obtained by any coalition of players, but does not take into account the role of the players when communication … between players is restricted. Existing values for communication graph games as the Myerson value and the average tree …

We introduce an efficient solution for games with communication graph structures and show that it is characterized by … efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the … communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when …

We analyze surplus allocation problems where cooperation between agents is restricted both by a communication graph and …