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

A situation in which a finite set of players can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility. A solution for TU-games assigns to every TU-game a distribution of the payoffs that can be earned over the individual players. Two well-known...

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

A cooperative game with transferable utilities, or simply aTU-game, describes a situation in which players can obtain certainpayoffs by cooperation. A solution mapping for these games is amapping which assigns to every game a set of payoff distributionsover the players in the game. Well-known...

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

The paper discusses the set of Harsanyi payoff vectors,also known as the Selectope. First, we reconsider some results on Harsanyi payoff vectors, published by Vasil'ev in the late 1970's, within a more general framework. In particular, these results state already that the set of Harsanyi payoff...