Power indices in spanning connectivity games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5564 LNCS, Issue , 2009, Pages 55-67

  Aziz, Haris ^a   Lachish, Oded ^a   Paterson, Mike ^a   Savani, Rahul ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Banzhaf index; Coalitional games; Network connectivity; Shapley Shubik index

Indexed keywords

BANZHAF INDEX; BANZHAF INDICES; BANZHAF VALUE; BOUNDED TREEWIDTH; COALITIONAL GAME; COALITIONAL GAMES; CONNECTIVITY GAMES; MULTIGRAPHS; NETWORK CONNECTIVITY; NP-HARD; P-COMPLETE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POWER INDICES; SHAPLEY-SHUBIK INDEX; SIMPLE GAMES; VOTING POWER;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

POLYNOMIAL APPROXIMATION;

EID: 70350630331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02158-9_7     Document Type: Conference Paper

References (23)

1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277-284 (1987)
2. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1), 11-24 (1989)
3. Aziz, H.: Complexity of comparison of influence of players in simple games. In: Proceedings of the Second International Workshop on Computational Social Choice (COMSOC 2008), pp. 61-72 (2008)
4. Aziz, H., Lachich, O., Paterson, M., Savani, R.: Wiretapping: the nucleolus of connectivity (submitted, 2009)
5. Bacher, R.: Determinants of matrices related to the Pascal triangle. J. Theór. des Nombres Bordeaux 14, 19-41 (2002)
6. Bachrach, Y., Markakis, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices. In: AAMAS 2008: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pp. 943-950 (2008)
7. Bachrach, Y., Rosenschein, J.S.: Computing the Banzhaf power index in network flow games. In: AAMAS 2007: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, pp. 1-7. ACM Press, New York (2007)
8. Bachrach, Y., Rosenschein, J.S., Porat, E.: Power and stability in connectivity games. In: AAMAS 2008: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, pp. 999-1006 (2008)
9. Bailey, R.A.: Surveys in Combinatorics. Cambridge University Press, Cambridge (1997)
10. Ball, M.O.: Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability 35(3), 230-239 (1986)
11. Borm, P., Hamers, H., Hendrickx, R.: Operations research games: A survey. TOP: An Offcial Journal of the Spanish Society of Statistics and Operations Research 9(2), 139-199 (2001)
12. Brandes, U., Erlebach, T.: Network Analysis: Methodological Foundations. Springer, Heidelberg (2005)
13. Crama, Y., Leruth, L.: Control and voting power in corporate networks: Concepts and computational aspects. European Journal of Operational Research 178(3), 879-893 (2007)
14. Curiel, I.: Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. Springer, Heidelberg (1997)
15. Deegan, J., Packel, E.: A new index of power for simple n-person games. International Journal of Game Theory 7(2), 113-123 (1978)
16. Dubey, P., Shapley, L.S.: Mathematical properties of the Banzhaf power index. Mathematics of Operations Research 4(2), 99-131 (1979)
17. Faliszewski, P., Hemaspaandra, L.A.: The complexity of power-index comparison. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 177-187. Springer, Heidelberg (2008)
18. Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Heidelberg (2001)
19. Granot, D., Maschler, M.: Spanning network games. International Journal of Game Theory 27(4), 467-500 (1998)
20. Holler, M.: Forming coalitions and measuring voting power. Political Studies 30(2), 262-271 (1982)
21. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer, Germany (2006)
22. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410-421 (1979)
23. van den Nouweland, A., Tijs, S., Maschler, M.: Monotonic games are spanning network games. International Journal of Game Theory 21(4), 419-427 (1993)