@article{oai:repository.nii.ac.jp:00000387,
 author = {宇野, 毅明 and Uno, Takeaki},
 journal = {NIIテクニカル・レポート, NII Technical Report},
 month = {Jul},
 note = {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, Banzhaf index, Shapley-Shubik index and Deegan-Packel index have been studied well. For computing these power indices, dynamic programming algorithms had been proposed. The time complexities of these algorithms are O(n^2q), O(n^3q), and O(n^4q), respectively. We propose new algorithms for computing power indices, whose time complexities are O(nq), O(n^2q), and O(n^2q), respectively.},
 pages = {1--10},
 title = {NII Technical Report (NII-2003-006E)：Efficient Computation of Power Indices for Weighted Majority Games},
 year = {2003}
}