The complexity of power-index comparison

We study the complexity of the following problem: Given two weighted voting games G? and G?? that each contain a player p, in which of these games is p's power index value higher? We study this problem with respect to both the Shapley-Shubik power index [16] and the Banzhaf power index [3,6]. Our main result is that for both of these power indices the problem is complete for probabilistic polynomial time (i.e., is PP-complete). We apply our results to partially resolve some recently proposed problems regarding the complexity of weighted voting games. We also show that, unlike the Banzhaf power index, the Shapley-Shubik power index is not #P-parsimonious-complete. This finding sets a hard limit on the possible strengthenings of a result of Deng and Papadimitriou [5], who showed that the Shapley-Shubik power index is #P-metric-complete.

[1]  Lane A. Hemaspaandra,et al.  Power balance and apportionment algorithms for the United States Congress , 1998, JEAL.

[2]  Pierluigi Crescenzi,et al.  Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.

[3]  Tomomi Matsui,et al.  NP-completeness for calculating power indices of weighted majority games , 2001, Theor. Comput. Sci..

[4]  Jerry S. Kelly,et al.  NP-completeness of some problems concerning voting games , 1990 .

[5]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[6]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[7]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[8]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[9]  Martin Shubik,et al.  A Method for Evaluating the Distribution of Power in a Committee System , 1954, American Political Science Review.

[10]  Heribert Vollmer.  On Different Reducibility Notions for Function Classes , 1994, STACS.

[11]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

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

[13]  Edith Elkind,et al.  Divide and conquer: false-name manipulations in weighted voting games , 2008, AAMAS.

[14]  José L. Balcázar,et al.  The polynomial-time hierarchy and sparse oracles , 1986, JACM.

[15]  Viktória Zankó,et al.  #P-Completeness via Many-One Reductions , 1990, Int. J. Found. Comput. Sci..

[16]  Harry B. Hunt,et al.  The Complexity of Planar Counting Problems , 1998, SIAM J. Comput..

[17]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[18]  Janos Simon.  On some central problems in computational complexity , 1975 .