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

This discussion paper led to a publication in 'Social Choice and Welfare', 2005, 24, 439-454.<P> 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...</p>

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