Approximating power indices

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2008, Pages 925-932

  Bachrach, Yoram ^a   Markakis, Evangelos ^b   Procaccia, Ariel D ^a   Rosenschein, Jeffrey S ^a   Saberi, Amin ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b CWI   (Netherlands)

^c Stanford University   (United States)

Author keywords

Power indices; Randomized algorithms

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS;

APPROXIMATE METHODS; COALITIONAL GAME; LOWER BOUNDS; POWER INDICES; RANDOMIZED ALGORITHMS; RANDOMIZED METHOD; VOTING GAME; WEIGHTED VOTING GAMES;

APPROXIMATION ALGORITHMS;

EID: 84899967235     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Y. Bachrach and J. S. Rosenschein. Computing the Banzhaf power index in network flow games. In The Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), pages 323-329, Honolulu, Hawaii, May 2007.
2. J. F. Banzhaf. Weighted voting doesn't work: a mathematical analysis. Rutgers Law Review, 19:317-343, 1965.
3. R. Barua, S. R. Chakravarty, and S. Roy. Measuring power in weighted majority games. Staff general research papers, Iowa State University, Department of Economics, May 2007.
4. J. M. Bilbao, J. R. Fernández, N. Jiménez, and J. J. López. Voting power in the European Union enlargement. European Journal of Operational Research, 143(1): 181-196, 2002.
5. J. M. Bilbao, J. R. Fernandez, A. J. Losada, and J. J. Lopez. Generating functions for computing power indices efficiently. TOP, pages 191-213, 2000.
6. J. Deegan and E. W. Packel. A new index of power for simple n-person games. International Journal of Game Theory, 7(2), 1978.
7. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Math. Oper. Res., 19(2):257-266, 1994.
8. P. Dubey and L. Shapley. Mathematical properties of the Banzhaf power index. Mathematics of Operations Research, 4(2):99-131, 1979.
9. S. S. Fatima, M. Wooldridge, and N. R. Jennings. A randomized method for the Shapley value for the voting game. In The Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), pages 955-962, Honolulu, Hawaii, May 2007.
10. D. Felsenthal and M. Machover. The measurement of voting power: Theory and practice, problems and paradoxes. Public Choice, 102(3-4):373-376, 2000.
11. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
12. A. Laruelle. On the choice of a power index. Papers 99-10, Valencia-Instituto de Investigaciones Económicas, 1999.
13. D. Leech. An empirical comparison of the performance of classical power indices. Political Studies, 50(l):l-22, 2002.
14. D. Leech. Voting power in the governance of the International Monetary Fund. Annals of Operations Research, 109(l-4):375-397, 2002.
15. D. Leech. Computing power indices for large voting games. Journal of Management Science, 49(6):831-837, 2003.
16. M. Machover and D. S. Felsenthal. The treaty of Nice and qualified majority voting. Social Choice and Welfare, 18(3):431-464, 2001.
17. I. Mann and L. S. Shapley. Values of large games, IV: Evaluating the Electoral College by Monte-Carlo techniques. Technical report, The Rand Corporation, Santa Monica, CA, 1960.
18. I. Mann and L. S. Shapley. Values of large games, VI: Evaluating the Electoral College exactly. Technical report, The Rand Corporation, Santa Monica, CA, 1962.
19. Y. Matsui and T. Matsui. A survey of algorithms for calculating power indices of weighted majority games. Journal of the Operations Research Society of Japan, 43, 2000.
20. Y. Matsui and T. Matsui. NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science, 263(l-2):305-310, 2001.
21. G. Owen. Multilinear extensions and the Banzhaf value. Naval Research Logistics Quarterly, 22(4):741-750, 1975.
22. L. S. Shapley. A value for n-person games. Contributions to the Theory of Games, pages 31-40, 1953.
23. L. S. Shapley and M. Shubik. A method for evaluating the distribution of power in a committee system. American Political Science Review, 48:787-792, 1954.
24. P. Straffin. Homogeneity, independence and power indices. Public Choice, 30:107-118, 1977.
25. A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In 18th Annual Symposium on Foundations of Computer Science (FOCS), pages 222-227, 1977.
26. H. P. Young. Cost allocation. The Handbook of Game Theory, Volume II, R. J. Aumann and S. Hart (eds.), pages 1193-1235, 1994.