which they usually take different positions. Two examples of such structures are communication networks and hierarchies. In … feasible sets in communication networks and compare them with feasible sets arising from hierarchies. …

distributing dividends. In this paper we consider games with limited communication structure in which the edges or links of an … measures for nodes in corresponding communication graphs. Special attention is given to the Harsanyi degree solution which … cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions …

allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are … 'games with ordered players' which is based on the distribution of 'dividends' taking into account the hierarchical ordering … of the players. For totally positive games this solution is always contained in the 'Core', and contains the well …

cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff … consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so …-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

cooperative games this trade-off can be framed as one of choosing to allocate according to the Shapley value or the equal division …

situations or (symmetric) network situations in which players can only cooperate if there are sufficient communication links in … the communication network. Another class of applications considers situations in which the players are hierarchically … ordered, i.e. they are part of a structure of asymmetric relations. Examples are auctions, airport games, sequencing …

Cooperative games with partial cooperation cover a wider rank of real world situations than the classic model of … cooperative games where every subset of a set of agents can form a coalition to execute the game. In this paper, the set of … particular cases, the communication situations and the permission structures, which are well-known both from a theoretical and …

-player agent game model, both being generalizations of the Shapley value for TU-games. The first is the agent-Shapley value and … the player- and agent-Shapley values we apply them to airport games and voting games. …

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 … neutrality for cycle-free graph games yields other solutions such as the hierarchical outcomes and the average tree solution …