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

We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted communication between as well as within the a priori unions of the coalition structure. Both types of...

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

We consider the problem of sharing water among agents located along a river. Each agent has quasi-linear preferences over river water and money, where the benefit of consuming an amount of water is given by a continuous and concave benefit function. A solution to the problem efficiently...

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...