Abstract
Power indices of weighted majority games are measures of the effects of parties on the voting in a council. Among the many kinds of power indices, the Banzhaf index, the Shapley–Shubik index, and the Deegan–Packel index have been studied well. For computing these power indices, dynamic programming algorithms have been proposed. The time complexities of these algorithms are O(n 2 q), O(n 3 q), and O(n 4 q), respectively. We propose new algorithms for the problems whose time complexities are O(nq), O(n 2 q), and O(n 2 q), respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aziz, H., Lachish, O., Paterson, M., Savani, R.: Power Indices in Spanning Connectivity Games. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 55–67. Springer, Heidelberg (2009)
Bachrach, Y., Rosenschein, J.S.: Computing the Banzhaf Power Index in Network Flow Games. In: AAMAS 2007 (2007)
Banzhaf III, J.F.: Weighted Voting doesn’t work. Rutgers Law Review 19, 317–343 (1965)
Brams, S.J., Affuso, P.J.: Power and size: a new paradox. Theory and Decision 7, 29–56 (1975)
Deegan, J., Packel, E.W.: A New Index of Power for Simple n-person Games. International Journal of Game Theory 7, 113–123 (1978)
Lucas, W.F.: Measuring Power in Weighted Voting Systems. In: Brams, S.J., Lucas, W.F., Straffin, P.D. (eds.) Political and Related Models, pp. 183–238. Springer (1983)
Matsui, T., Matsui, Y.: A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games. Journal of the Operations Research Society of Japan 43, 71–86 (2000)
Shapley, L.S., Shubik, M.: A Method for Evaluating the Distribution of Power in a Committee System. American Political Science Review 48, 787–792 (1954)
Shapley, L.S.: The Shapley value: essays in honor of Lloyd S. Shapley. Cambridge University Press (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uno, T. (2012). Efficient Computation of Power Indices for Weighted Majority Games. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)