A SURVEY OF ALGORITHMS FOR CALCULATING POWER INDICES OF WEIGHTED MAJORITY GAMES
Authors:
Open Access
- 1 January 2000
- journal article
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 43 (1) , 71-86
Abstract
Iibr measuring an individual's veting power of a voting game, some power indices are proposed. In this paper, we discuss the problems fbr calculating the Shapley-Shubik index, the Banzhaf index and the Deegan-Packel index of weighted majority garnes. 1. Introdution In 1944, john von Neurnann and Oskar Mor'genstern studied the distribution of power inKeywords
This publication has 15 references indexed in Scilit:
- A value for n-person games1988
- Measuring Power in Weighted Voting Systems1983
- A new index of power for simplen-person gamesInternational Journal of Game Theory, 1978
- Multilinear extensions and the banzhaf valueNaval Research Logistics Quarterly, 1975
- On the uniqueness of the Shapley valueInternational Journal of Game Theory, 1975
- Nucleoluses of Compound Simple GamesSIAM Journal on Applied Mathematics, 1974
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972
- Reducibility among Combinatorial Problems1972
- Notes on the theory of dynamic programming IV ‐ Maximization over discrete setsNaval Research Logistics Quarterly, 1956
- A Method for Evaluating the Distribution of Power in a Committee SystemAmerican Political Science Review, 1954