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

[1]  Yves Crama,et al.  Control and voting power in corporate networks: Concepts and computational aspects , 2007, Eur. J. Oper. Res..

[2]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[3]  Costas S. Iliopoulos,et al.  A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.

[4]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[5]  Ely Porat,et al.  Power and stability in connectivity games , 2008, AAMAS.

[6]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[7]  Imma Curiel,et al.  Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems , 1997 .

[8]  Evangelos Markakis,et al.  Approximating power indices , 2008, AAMAS.

[9]  J. Deegan,et al.  A new index of power for simplen-person games , 1978 .

[10]  Jeffrey S. Rosenschein,et al.  Computing the Banzhaf power index in network flow games , 2007, AAMAS '07.

[11]  Imma Curiel,et al.  Cooperative game theory and applications , 1997 .

[12]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[13]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[14]  睦憲 柳浦,et al.  Combinatorial Optimization : Theory and Algorithms (3rd Edition), B. Korte and J. Vygen 著, 出版社 Springer, 発行 2006年, 全ページ 597頁, 価格 53.45ユーロ, ISBN 3-540-25684-9 , 2006 .

[15]  Haris Aziz,et al.  Complexity of comparison of influence of players in simple games , 2008, ArXiv.

[16]  Herbert Hamers,et al.  Operations research games: A survey , 2001 .

[17]  Stef Tijs,et al.  Monotonic games are spanning network games , 1993 .

[18]  Pradeep Dubey,et al.  Mathematical Properties of the Banzhaf Power Index , 1979, Math. Oper. Res..

[19]  Roland Bacher,et al.  Determinants of matrices related to the Pascal triangle , 2002 .

[20]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[21]  Piotr Faliszewski,et al.  The complexity of power-index comparison , 2009, Theor. Comput. Sci..

[22]  Forming Coalitions and Measuring Voting Power , 1982 .

[23]  Michael Maschler,et al.  Spanning network games , 1998, Int. J. Game Theory.

[24]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[25]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[26]  Rosemary A. Bailey.  Surveys in Combinatorics, 1997: Preface , 1997 .