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

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>

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

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

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

Despite linear programming and duality have correctly been incorporated in algorithms to compute the nucleolus, we have found mistakes in how these have been used in a broad range of applications. Overlooking the fact that a linear program can have multiple optimal solutions and neglecting the...