We consider the problem of sharing water from a river among the group of countries located along it. The benefit of each country depends on the amount of water it consumes. An allocation of the water is efficient when it maximizes the total benefits of the countries. The problem of finding a...

We provide a new and concise characterization of the Banzhaf value on the (linear) space of all TU-games on a fixed player set by means of two transparent axioms. The first one is the well-known Dummy player axiom. The second axiom, called Strong transfer invariance, indicates that a player's...

In this article, we study cooperative games with limited cooperation possibilities, represented by a tree on the set of agents. Agents in the game can cooperate if they are connected in the tree. We first derive direct-sum decompositions of the space of TU-games on a fixed tree, and two new...

The axiom of Balanced collective contributions is introduced as a collective variant of the axiom of Balanced contributions proposed by Myerson (1980). It requires that the identical average impact of the withdrawal of any agent from a game on the remaining population. It turns out that Balanced...

We replace the axiom of fairness used in the characterization of the Myerson value (Myerson, 1977) by fairness for neighbors in order to characterize the component-wise egalitarian solution. When a link is broken, fairness states the two players incident to the link should be affected similarly...

For any transferable utility game in coalitional form with nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is less than or equal to n(n-1)/2, where n is the cardinality of the player set. This number...

This article studies values for cooperative games with transferable utility. Numerous such values can be characterized by axioms of associated consistency, which require that a value is invariant under some parametrized linear transformation on the vector space of cooperative games with...

We consider communication situations games being the combination of a TU-game and a communication graph. We study the average tree (AT) solutions introduced by Herings \sl et al. [9] and [10]. The AT solutions are defined with respect to a set, say T, of rooted spanning trees of the...