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

We introduce new axioms for the class of all TU-games with a fixed but arbitrary player set, which require either invariance of an allocation rule or invariance of the payoff assigned by an allocation rule to a specified subset of players in two related TU-games. Comparisons with other axioms...

This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or...

We consider an alternative expression of the Shapley value that reveals a system of compensations: each player receives an equal share of the worth of each coalition he belongs to, and has to compensate an equal share of the worth of any coalition he does not belong to. We give an interpretation...

In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a...

We consider the problem of allocating the income of museum pass programs. Various properties of an allocation rule for such problems are introduced. Two allocation rules are characterized and are shown to coincide with the Shapley value and the equal division solution of the associated tu-game...

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

In Béal et al. (2013) two new axioms of invariance, called Addition invariance and Transfer invariance respectively, are introduced to design allocation rules for TU-games. Here, we derive direct sum decompositions of the linear space of TU-games by using the TU-games selected to construct the...

If a player is removed from a game, what keeps the payoff of the remaining players unchanged? Is it the removal of a special player or its presence among the remaining players? This article answers this question in a complement study to Kamijo and Kongo (2012). We introduce axioms of invariance...