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

The cover of a transport, social, or communication network is a computationally complex problem. To deal with it, this paper introduces a special class of simple games in which the set of minimal winning coalitions coincides with the set of least covers. A distinctive feature of such a game is...

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

We consider a multi-player, cooperative, transferable-utility, symmetric game (N,v) and associated convex covers, i.e., convex games (N,w) such that w is greater than or equal to v. A convex cover w is efficient iff w(0) equals v(0) and w(N) equals v(N); and minimal iff there is no convex cover...

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

Markets for natural resources and commodities are often oligopolistic. In these markets, production capacities are key for strategic interaction between the oligopolists. We analyze how different market structures influence oligopolistic capacity investments and thereby affect supply, prices and...