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 2q), O(n3q), and O(n4q), respectively. We propose new algorithms for the problems whose time complexities areO(nq),O(n2q), andO(n2q), respectively. © Springer-Verlag 2012.
Cite
CITATION STYLE
Uno, T. (2012). Efficient computation of power indices for weighted majority games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 679–689). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_70
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
