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 cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley...

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division solution. In the literature various axiomatizations of these solutions can be found. Axiomatizations of the Shapley value often use efficiency which is not satisfied by the Banzhaf...

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

One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...

Recently, cooperative game theory has been applied to various economic allocation problems in which players are not fully anonymous but belong to some relational structure. One of the most developed models in this respect are communications situations or (symmetric) network situations in which...