Power and stability in connectivity games

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

Volumn 2, Issue , 2008, Pages 981-988

  Bachrach, Yoram ^a   Rosenschein, Jeffrey S ^a   Porat, Ely ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Computational complexity; Network Reliability; Power indices

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; MULTI AGENT SYSTEMS; RELIABILITY;

COALITIONAL GAME; COMPUTATIONAL ASPECTS; CONNECTIVITY GAMES; GAME-THEORETIC; NETWORK RELIABILITY; POLYNOMIAL ALGORITHM; POWER INDICES; VERTEX CONNECTIVITY;

TREES (MATHEMATICS);

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

References (21)

1. Y. Bachrach and J. S. Rosenschein. Computing the Banzhaf power index in network flow games. In The 6th Int. Joint Conference on Autonomous Agents and Multiagent Systems, pages 323-329, May 2007.
2. J. F. Banzhaf. Weighted voting doesn't work: a mathematical analysis. Rutgers Law Review, 19:317-343, 1965.
3. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Math. Oper. Res., 19(2):257-266, 1994.
4. P. Dubey and L. Shapley. Mathematical properties of the Banzhaf power index. Mathematics of Operations Research, 4(2):99-131, 1979.
5. E. Elkind, L. A. Goldberg, P. W. Goldberg, and M. Wooldridge. Computational complexity of weighted threshold games. In The National Conference on Artificial Intelligence, pages 718-723, 2007.
6. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21-41, 2001.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.
8. D. B. Gillies. Some theorems on n-person games. PhD thesis, Princeton University, 1953.
9. A. Lamelle. On the choice of a power index. Papers 99-10, Valencia-Instituto de Investigaciones Económicas, 1999.
10. D. Leech. Voting power in the governance of the International Monetary Fund. Annals of Operations Research, 109(l-4):375-397, 2002.
11. M. Machover and D. S. Felsenthal. The treaty of Nice and qualified majority voting. Social Choice and Welfare, 18(3):431-464, 2001.
12. 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.
13. 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.
14. Y. Matsui and T. Matsui. NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science, 263(l-2):305-310, 2001.
15. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, 12(4):777-788, 1983.
16. L. S. Shapley. A value for n-person games. Contributions to the Theory of Games, pages 31-40, 1953.
17. 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.
18. P. Straffin. Homogeneity, independence and power indices. Public Choice, 30:107-118, 1977.
19. S. P. Vadhan. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing, 31(2):398-427, 2002.
20. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8:410-421, 1979.
21. M. Yokoo, V. Conitzer, T. Sandholm, N. Olita, and A. Iwasaki. Coalitional games in open anonymous environments. In The 20th National Conference on Artificial Intelligence, pages 509-514, 2005.