Power Indices in Spanning Connectivity Games
نویسندگان
چکیده
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational complexity of computing the voting power indices of edges in the SCG. It is shown that computing Banzhaf values is #P-complete and computing ShapleyShubik indices or values is NP-hard for SCGs. Interestingly, Holler indices and Deegan-Packel indices can be computed in polynomial time. Among other results, it is proved that Banzhaf indices can be computed in polynomial time for graphs with bounded treewidth. It is also shown that for any reasonable representation of a simple game, a polynomial time algorithm to compute the Shapley-Shubik indices implies a polynomial time algorithm to compute the Banzhaf indices. This answers (positively) an open question of whether computing Shapley-Shubik indices for a simple game represented by the set of minimal winning coalitions is NP-hard.
منابع مشابه
Spanning connectivity games
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational complexity of computing the voting power indices of edges in the SCG. It is shown tha...
متن کاملPower Indices and the Measurement of Control in Corporate Structures
Power indices reflect the importance of the players in a cooperative game. In the context of simple games, or voting games, they have been first introduced in pioneering papers by Penrose [1946], Shapley and Shubik [1954], Banzhaf [1965], and subsequently investigated in a huge number of papers spanning across many scientific disciplines, from political science and economics to mathematics and ...
متن کاملEccentric Connectivity and Augmented Eccentric Connectivity Indices of N-Branched Phenylacetylenes Nanostar Dendrimers
متن کامل
Connectivity as a Measure of Power System Integrity
Measures of network structural integrity useful in the analysis and synthesis of power systems are discussed. Signal flow methodology is applied to derive an expression for the paths between sources and sinks in a power network. Connectivity and reach ability properties of the network are obtained using the minors of a modified connectivity matrix. Node-connectivity, branch connectivity and mix...
متن کاملRuler of the Plane – Games of Geometry
Ruler of the Plane is a set of games illustrating concepts from combinatorial and computational geometry. The games are based on the art gallery problem, ham-sandwich cuts, the Voronoi game, and geometric network connectivity problems like the Euclidean minimum spanning tree and traveling salesperson problem. 1998 ACM Subject Classification F.2.2 [Nonnumerical Algorithms and Problems] Geometric...
متن کامل