The Complexity of Power-Index Comparison

  • Piotr Faliszewski
  • Lane A. Hemaspaandra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)

Abstract

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.

Keywords

Weighted voting games power indices computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bachrach, Y., Elkind, E.: Divide and conquer: False-name manipulations in weighted voting games. In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems, May 2008 (to appear, 2008)Google Scholar
  2. 2.
    Balcázar, J., Book, R., Schöning, U.: The polynomial-time hierarchy and sparse oracles. Journal of the ACM 33(3), 603–617 (1986)CrossRefMATHGoogle Scholar
  3. 3.
    Banzhaf, J.: Weighted voting doesn’t work: A mathematical analysis. Rutgers Law Review 19, 317–343 (1965)Google Scholar
  4. 4.
    Bovet, D., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice-Hall, Englewood Cliffs (1993)MATHGoogle Scholar
  5. 5.
    Deng, X., Papadimitriou, C.: On the complexity of comparative solution concepts. Mathematics of Operations Research 19(2), 257–266 (1994)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Dubey, P., Shapley, L.: Mathematical properties of the Banzhaf power index. Mathematics of Operations Research 4(2), 99–131 (1979)MathSciNetMATHGoogle Scholar
  7. 7.
    Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference, pp. 613–622. ACM Press, New York (2001)Google Scholar
  8. 8.
    Faliszewski, P., Hemaspaandra, L.: The complexity of power-index comparison. Technical Report TR-929, Department of Computer Science, University of Rochester, Rochester, NY (January 2008)Google Scholar
  9. 9.
    Gill, J.: Computational complexity of probabilistic Turing machines. SIAM Journal on Computing 6(4), 675–695 (1977)CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    Hemaspaandra, L., Rajasethupathy, K., Sethupathy, P., Zimand, M.: Power balance and apportionment algorithms for the United States Congress. ACM Journal of Experimental Algorithmics 3(1) (1998), http://www.jea.acm.org/1998/HemaspaandraPower
  11. 11.
    Hunt, H., Marathe, M., Radhakrishnan, V., Stearns, R.: The complexity of planar counting problems. SIAM Journal on Computing 27(4), 1142–1167 (1998)CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    Krentel, M.: The complexity of optimization problems. Journal of Computer and System Sciences 36(3), 490–509 (1988)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Matsui, Y., Matsui, T.: NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science 263(1–2), 305–310 (2001)CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)MATHGoogle Scholar
  15. 15.
    Prasad, K., Kelly, J.: NP-completeness of some problems concerning voting games. International Journal of Game Theory 19(1), 1–9 (1990)CrossRefMathSciNetMATHGoogle Scholar
  16. 16.
    Shapley, L., Shubik, M.: A method of evaluating the distribution of power in a committee system. American Political Science Review 48, 787–792 (1954)CrossRefGoogle Scholar
  17. 17.
    Simon, J.: On Some Central Problems in Computational Complexity. PhD thesis, Cornell University, Ithaca, N.Y, Available as Cornell Department of Computer Science Technical Report TR75-224 (January 1975)Google Scholar
  18. 18.
    Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)CrossRefMathSciNetMATHGoogle Scholar
  19. 19.
    Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189–201 (1979)CrossRefMathSciNetMATHGoogle Scholar
  20. 20.
    Zankó, V.: #P-completeness via many-one reductions. International Journal of Foundations of Computer Science 2(1), 76–82 (1991)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Piotr Faliszewski
    • 1
  • Lane A. Hemaspaandra
    • 1
  1. 1.Department of Computer ScienceUniversity of RochesterRochester 

Personalised recommendations