Hamiache (2001) assigns to every TU game a so-called associated game and then shows that the Shapley value is characterized as the unique solution for TU games satisfying the inessential game property, continuity and associated consistency. The latter notion means that for every game the Shapley...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

Given any alpha in [0,1], an alpha-constant-sum game on a finite set of players, N, is a function that assigns a real number to any coalition S (being a subset of the player set N), such that the sum of the worth of the coalition S and the worth of its complementary coalition N\S is alpha times...

In view of the nature of pursuing profit, a selfish coefficient function is employed to describe the degrees of selfishness of players in different coalitions, which is the desired rate of return to the worth of coalitions. This function brings in the concept of individual expected reward to...

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many of these problems, players are organized according to either a hierarchical structure or a levels structure that restrict players' possibilities to cooperate. In this paper, we...

Recently, applications of cooperative game theory to economicallocation problems have gained popularity. To understandthese applications better, economic theory studies thesimilarities and differences between them. The purpose of thispaper is to investigate a special class of cooperative...

A cooperative game with transferable utility describes a situation inwhich players can obtain certain payoffs by cooperation. A sharefunction for such games is a function which assigns for every game adistribution of the payoffs over the players in the game.In this paper we consider cooperative...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff vectors to every TU-game. Some solutions that are based on distributing...

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...