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

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

As a new type of technique, simplicial methods have yielded extremely important contributions toward solutions of a system of nonlinear equations. Theoretical investigations and numerical tests have shown that the performance of simplicial methods depends critically on the triangulations...