We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players, for instance a hierarchical ordering or a dominance relation.The social structure is utilized to refine the core of the game, being the set of payoffs to the...

Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...

In this paper we generalize the concept of a non-transferable utility game by introducing the concept of a socially structured game.A socially structured game is given by a set of players, a possibly empty collection of internal organizations on any subset of players, for any internal...

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average...

A cooperative game with non-transferable utility (NTU-game) consists of a collection of payoff sets for the subsets of a finite set of players, for which it has to be determined how much payoff each player must receive. The core of an NTU-game consists of all payoff vectors that are in the...