Efficient computation of the shapley value for game-theoretic network centrality

Journal of Artificial Intelligence Research

Volumn 46, Issue , 2013, Pages 607-650

  Michalak, Tomasz P ^a,b   Aadithya, Karthik V ^c   Szczepanski, Piotr L ^d   Ravindran, Balaraman ^e   Jennings, Nicholas R ^f  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^e INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^f UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATION NETWORK; COMPUTATIONAL ASPECTS; COMPUTATIONAL PROPERTIES; EFFICIENT COMPUTATION; INFRASTRUCTURE NETWORKS; MONTE CARLO SIMULATIONS; MONTE-CARLO APPROXIMATIONS; NETWORK CENTRALITIES;

ASTROPHYSICS; GAME THEORY; MONTE CARLO METHODS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84878289680     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3806     Document Type: Article

References (64)

1. Aadithya, K., Michalak, T., & Jennings, N. (2011). Representation of coalitional games with algebraic decision diagrams. In AAMAS '11: Proceedings of the 10th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 1121-1122.
2. Amer, R., Giménez, J., & Magana, A. (2012). Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games. Mathematical Methods of Operations Research, 75, 105-134.
3. Aziz, H., Lachish, O., Paterson, M., & Savani, R. (2009a). Power indices in spanning connectivity games. In AAIM '09: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management, pp. 55-67.
4. Aziz, H., Lachish, O., Paterson, M., & Savani, R. (2009b). Wiretapping a hidden network. In WINE '09: Proceedings of the the 5th Workshop on Internet & Network Economics, pp. 438-446.
5. Bachrach, Y., Markakis, E., Procaccia, A. D., Rosenschein, J. S., & Saberi, A. (2008a). Approximating power indices. In AAMAS '08: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 943-950.
6. Bachrach, Y., Rosenschein, J. S., & Porat, E. (2008b). Power and stability in connectivity games. In AAMAS '08: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 999-1006.
7. Bachrach, Y., & Rosenschein, J. (2009). Power in threshold network flow games. Autonomous Agents and Multi-Agent Systems, 18 (1), 106-132.
8. Banzhaf, J. F. (1965). Weighted Voting Doesn't Work: A Mathematical Analysis. Rutgers Law Rev., 19, 317-343.
9. Bikhchandani, S., Hirshleifer, D., & Welch, I. (1992). A theory of fads, fashion, custom, and cultural change in informational cascades. Journal of Political Economy, 100 (5), 992-1026.
10. Bolus, S. (2011). Power indices of simple games and vector-weighted majority games by means of binary decision diagrams. European Journal of Operational Research, 210 (2), 258-272.
11. Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2 (1), 113-120.
12. Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92 (5), 1170-1182.
13. Borgatti, S. P., & Everett, M. (2006). A graph-theoretic framework for classifying centrality measures. social networks. Social Networks, 28(4), 466-484.
14. Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25 (2), 163-177.
15. Brandes, U., & Erlebach, T. (2005). Network Analysis: Methodological Foundations. Lecture notes in computer science: Tutorial. Springer.
16. Castro, J., Gomez, D., & Tejada, J. (2009). Polynomial calculation of the shapley value based on sampling. Computers & Operations Research, 36 (5), 1726-1730.
17. Chalkiadakis, G., Elkind, E., & Wooldridge, M. (2011). Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers.
18. Conitzer, V., & Sandholm, T. (2004). Computing Shapley Values, manipulating value division schemes and checking core membership in multi-issue domains. In AAAI '04: Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp. 219-225.
19. Cormen, T. (2001). Introduction to algorithms. MIT Press.
20. del Pozo, M., Manuel, C., González-Arangüena, E., & Owen, G. (2011). Centrality in directed social networks. a game theoretic approach. Social Networks, 33 (3), 191-200.
21. Deng, X., & Papadimitriou, C. (1994). On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19 (2), 257-266.
22. Elkind, E., Goldberg, L., Goldberg, P., & Wooldridge, M. (2009). A tractable and expressive class of marginal contribution nets and its applications. Mathematical Logic Quarterly, 55 (4), 362-376.
23. Eppstein, D., &Wang, J. (2001). Fast approximation of centrality. In SODA '01: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 228-229.
24. Everett, M. G., & Borgatti, S. P. (1999). The centrality of groups and classes.. Journal of Mathematical Sociology, 23 (3), 181-201.
25. Fatima, S. S., Wooldridge, M., & Jennings, N. (2007). A randomized method for the shapley value for the voting game. In AAMAS '07: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 955-962.
26. Fatima, S. S., Wooldridge, M., & Jennings, N. (2008). A linear approximation method for the shapley value. Artificial Intellilgence, 172 (14), 1673-1699.
27. Freeman, L. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1 (3), 215-239.
28. Gómez, D., González-Arangüena, E., Manuel, C., Owen, G., Del Pozo, M., & Tejada, J. (2003). Centrality and power in social networks: A game theoretic approach. Mathematical Social Sciences, 46 (1), 27-54.
29. Goyal, A., Bonchi, F., & Lakshmanan, L. V. (2010). Learning influence probabilities in social networks. In WSDM '10: Proceedings of the 3rd ACM international conference on Web search and data mining, pp. 241-250.
30. Granovetter, M. (1978). Threshold models of collective behavior. American Journal of Sociology, 83 (6), 1420-1443.
31. Greco, G., Malizia, E., Palopoli, L., & Scarcello, F. (2009). On the complexity of compact coalitional games. In IJCAI '09: Proceedings of the Twenty First International Joint Conference on Artifical Intelligence, pp. 147-152.
32. Grofman, B., & Owen, G. (1982). A game-theoretic approach to measuring centrality in social networks. Social Networks, 4, 213-224.
33. Ieong, S., & Shoham, Y. (2005). Marginal contribution nets: a compact representation scheme for coalitional games. In EC '05: Proceedings of the Sixth ACM Conference on Electronic Commerce, pp. 193-202.
34. Irwin, M., & Shapley, L. S. (1960). Values of Large Games, IV : Evaluating the Electoral College by Montecarlo Techniques. CA : RAND Corporation, Santa Monica.
35. Jeong, H., Mason, S. P., Barabasi, A. L., & Oltvai, Z. N. (2001). Lethality and centrality in protein networks. Nature, 411 (6833), 41-42.
36. Kempe, D., Kleinberg, J., & Tardos, É. (2003). Maximizing the spread of influence through a social network. In KDD '03: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137-146.
37. Kempe, D., Kleinberg, J., & Tardos, É. (2005). Influential nodes in a diffusion model for social networks. Automata, Languages and Programming, 3580, 99.
38. Koschützki, D., Lehmann, K., Peeters, L., Richter, S., Tenfelde-Podehl, D., & Zlotowski, O. (2005). Centrality indices. Network analysis, Vol. 3418 of Lecture Notes in Computer Science, pp. 16-61. Springer.
39. Lee, M.-J., Lee, J., Park, J. Y., Choi, R. H., & Chung, C.-W. (2012). Qube: a quick algorithm for updating betweenness centrality. In Mille, A., Gandon, F. L., Misselis, J., Rabinovich, M., & Staab, S. (Eds.), WWW, pp. 351-360. ACM
40. Mann, I., & Shapley, L. (1962). Values of large games, VI: Evaluating the electoral college exactly. RAND Research Memorandum.
41. Matsui, T., & Matsui, Y. (2000). A survey of algorithms for calculating power indices of weighted majority games. Journal of the Operations Research Society of Japan, 43, 71-86.
42. Michalak, T., Marciniak, D., Samotulski, M., Rahwan, T., McBurney, P., Wooldridge, M., & Jennings, N. (2010a). A logic-based representation for coalitional games with externalities. In AAMAS '10: Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 125-132.
43. Michalak, T., Rahwan, T., Marciniak, D., Szamotulski, M., & Jennings, N. (2010b). Computational aspects of extending the Shapley Value to coalitional games with externalities. In ECAI '10: Proceedings of the Nineteenth European Conference on Artificial Intelligence.
44. Myerson, R. (1977). Graphs and cooperation in games. Mathematics of Operations Research, 2 (3), 225-229.
45. Nagamochi, H., Zeng, D., Kabutoya, N., & Ibaraki, T. (1997). Complexity of the minimum base game on matroids. Mathematics of Operations Research, 22 (1), 146-164.
46. Newman, M. (2001). Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E, 64 (1), 016132(1-7).
47. Noh, J., & Rieger, H. (2004). Random walks on complex networks. Physical Review Letters, 92 (11), 118701(1-4).
48. Osborne, M. J., & Rubinstein, A. (1994). A Course in Game Theory, Vol. 1 of MIT Press Books. The MIT Press.
49. Reka, A., & Barabási, A. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47-97.
50. Sakurai, Y., Ueda, S., Iwasaki, A., Minato, S., & Yokoo, M. (2011). A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams. In PRIMA '11: Public Risk Management Association, pp. 4-18.
51. Schmeidler, D. (1969). The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics, 1163-1170.
52. Schultes, D., & Sanders, P. (2007). Dynamic highway-node routing. In SEA '07: Proceedings of 6th Workshop on Experimental and Efficient Algorithms. LNCS, pp. 66-79. Springer.
53. Shapley, L. S. (1953). A value for n-person games. In Kuhn, H., & Tucker, A. (Eds.), In Contributions to the Theory of Games, volume II, pp. 307-317. Princeton University Press.
54. Shapley, L. S., & Shubik, M. (1954). A Method for Evaluating the Distribution of Power in a Committee System. The American Political Science Review, 48 (3), 787-792.
55. Stephenson, K., & Zelen, M. (1989). Rethinking centrality: Methods and examples. Social Networks, 11 (1), 1-37.
56. Suri, N., & Narahari, Y. (2008). Determining the top-k nodes in social networks using the shapley value. In AAMAS '08: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 1509-1512.
57. Suri, N., & Narahari, Y. (2010). A Shapley Value based approach to discover influential nodes in social networks. IEEE Transaction on Automation Science and Engineering, 99, 1-18.
58. Szczepanski, P. L., Michalak, T., & Rahwan, T. (2012). A new approach to betweenness centrality based on the shapley value. In AAMAS '12: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 239-246.
59. Valente, T. (1996). Social network thresholds in the diffusion of innovations. Social Networks, 18 (1), 69-89.
60. Watts, D., & Strogatz, S. (1998). Collective dynamics of small-world networks. Nature, 393 (6684), 440-442.
61. Wooldridge, M., & Dunne, P. (2006). On the computational complexity of coalitional resource games. Artificial Intelligence, 170 (10), 835-871.
62. Yi, S.-S. (1997). Stable coalition structures with externalities. Games and Economic Behavior, 20 (2), 201-237.
63. Young, H. P. (2006). The Diffusion of Innovations in Social Networks. In Blume, B. L., & Durlauf, S. N. (Eds.), Economy as an evolving complex system, Vol. 3 of Proceedings volume in the Santa Fe Institute studies in the sciences of complexity Santa Fe Institute Studies on the Sciences of Complexity, pp. 267-282. Oxford University Press US
64. Zolezzi, J. M., & Rudnick, H. (2002). Transmission cost allocation by cooperative games and coalition formation. IEEE Transactions on Power Systems, 17, 1008-1015.