A Shapley Value-based Approach to Determine Gatekeepers in Social Networks with Applications
暂无分享,去创建一个
Oskar Skibski | Tomasz P. Michalak | Hemank Lamba | Ramasuri Narayanam | Ramasuri Narayanam | Hemank Lamba | Oskar Skibski
[1] Oskar Skibski,et al. Algorithms for the shapley and myerson values in graph-restricted games , 2014, AAMAS.
[2] E. David,et al. Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .
[3] Y. Narahari,et al. Determining the top-k nodes in social networks using the Shapley value , 2008, AAMAS.
[4] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[5] Peter Borm,et al. Characterizations of the β- and the Degree Network Power Measure , 2008 .
[6] Noah E. Friedkin,et al. Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.
[7] Michalis Faloutsos,et al. Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks , 2011, IEEE ICDM 2011.
[8] Jeffrey D. Ullman,et al. Set Merging Algorithms , 1973, SIAM J. Comput..
[9] Guillermo Owen,et al. Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..
[10] G. Owen,et al. A game theoretic approach to measuring degree of centrality in social networks , 1982 .
[11] Ulrik Brandes,et al. Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .
[12] S. Borgatti,et al. The centrality of groups and classes , 1999 .
[13] René van den Brink,et al. Measuring domination in directed networks , 2000, Soc. Networks.
[14] Roger B. Myerson,et al. Graphs and Cooperation in Games , 1977, Math. Oper. Res..
[15] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[16] Michael J. Fischer,et al. An improved equivalence algorithm , 1964, CACM.
[17] Wei Chen,et al. A game-theoretic framework to identify overlapping communities in social networks , 2010, Data Mining and Knowledge Discovery.
[18] René van den Brink,et al. The apex power measure for directed networks , 2002, Soc. Choice Welf..
[19] Nicholas R. Jennings,et al. A linear approximation method for the Shapley value , 2008, Artif. Intell..
[20] Noga Alon,et al. Sum of us: strategyproof selection from the selectors , 2009, TARK XIII.
[21] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[22] L. Shapley. A Value for n-person Games , 1988 .
[23] Daniel Gómez,et al. Polynomial calculation of the Shapley value based on sampling , 2009, Comput. Oper. Res..
[24] Peter Borm,et al. The VL control measure for symmetric networks , 2009, Soc. Networks.
[25] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[26] Nicholas R. Jennings,et al. Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks , 2013, IJCAI.
[27] M E J Newman,et al. Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[28] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..
[29] Evangelos Markakis,et al. Approximating power indices , 2008, AAMAS.