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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Faliszewski, P., & Hemaspaandra, L. A. (2008). The complexity of power-index comparison. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 177–187). https://doi.org/10.1007/978-3-540-68880-8_18
Mendeley helps you to discover research relevant for your work.