Efficient algorithms for game-theoretic betweenness centrality
暂无分享,去创建一个
[1] Jeffrey S. Rosenschein,et al. Power in threshold network flow games , 2009, Autonomous Agents and Multi-Agent Systems.
[2] Guillermo Owen,et al. Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..
[3] Martin G. Everett,et al. A Graph-theoretic perspective on centrality , 2006, Soc. Networks.
[4] Y. Narahari,et al. A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.
[5] Ulrik Brandes,et al. On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.
[6] David P. Morton,et al. Stochastic Network Interdiction , 1998, Oper. Res..
[7] Rahul Savani,et al. Cooperative max games and agent failures , 2014, AAMAS.
[8] Moshe Tennenholtz,et al. Congestion Games with Agent Failures , 2012, AAAI.
[9] M. Grabisch,et al. Transversality of the Shapley value , 2008 .
[10] Oskar Skibski,et al. Algorithms for the shapley and myerson values in graph-restricted games , 2014, AAMAS.
[11] Jeffrey S. Rosenschein,et al. Effort Games and the Price of Myopia , 2009, Math. Log. Q..
[12] L. Freeman,et al. Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .
[13] Pradeep Dubey,et al. Value Theory Without Efficiency , 1981, Math. Oper. Res..
[14] Robert J. Weber,et al. Probabilistic Values for Games , 1977 .
[15] Beom Jun Kim,et al. Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[16] Kimmo Soramäki,et al. SinkRank: An Algorithm for Identifying Systemically Important Banks in Payment Systems , 2013 .
[17] Silvia Gabrieli. Too-Interconnected Versus Too-Big-to-Fail: Banks’ Network Centrality and Overnight Interest Rates , 2011 .
[18] Armin R. Mikler,et al. A method for reducing the severity of epidemics by allocating vaccines according to centrality , 2014, BCB.
[19] Heinrich von Stackelberg,et al. Stackelberg (Heinrich von) - The Theory of the Market Economy, translated from the German and with an introduction by Alan T. PEACOCK. , 1953 .
[20] Eva Hüpkes. Resolving systemically important financial institutions (SIFIs): The Financial Stability Board key attributes of effective resolution regimes , 2013 .
[21] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[22] Churlzu Lim,et al. Algorithms for Network Interdiction and Fortification Games , 2008 .
[23] Konstantin Avrachenkov,et al. Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.
[24] H. Young. Monotonic solutions of cooperative games , 1985 .
[25] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[26] J. Anthonisse. The rush in a directed graph , 1971 .
[27] Guillermo Owen,et al. Centrality in directed social networks. A game theoretic approach , 2011, Soc. Networks.
[28] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[29] Tomasz P. Michalak,et al. A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value , 2014, ECAI.
[30] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[31] Makoto Yokoo,et al. A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games , 2015, IJCAI.
[32] Nicholas R. Jennings,et al. Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks , 2013, IJCAI.
[33] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[34] L. Freeman. Centrality in social networks conceptual clarification , 1978 .
[35] Simone Giansante,et al. Recent advances in modelling systemic risk using network analysis - ECB , 2010 .
[36] Marc Barthelemy,et al. Group betweenness and co-betweenness: Inter-related notions of coalition centrality , 2009, Soc. Networks.
[37] A. Roth. The Shapley value , 2005, Game Theory.
[38] L. Shapley. A Value for n-person Games , 1988 .
[39] David A. Bader,et al. A Fast Algorithm for Streaming Betweenness Centrality , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.
[40] Yoram Bachrach,et al. The Least-Core of Threshold Network Flow Games , 2011, MFCS.
[41] Silvia Gabrieli. Too-Connected Versus Too-Big-To-Fail: Banks’ Network Centrality and Overnight Interest Rates , 2011 .
[42] Eitan Zemel,et al. Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..
[43] Michael Wooldridge,et al. Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.
[44] Herbert Hamers,et al. Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda , 2013, Eur. J. Oper. Res..
[45] Rami Puzis,et al. Routing betweenness centrality , 2010, JACM.
[46] Rafael Amer,et al. Accessibility in oriented networks , 2007, Eur. J. Oper. Res..
[47] Lucy Skrabanek,et al. PDZBase: a protein?Cprotein interaction database for PDZ-domains , 2005, Bioinform..
[48] Serdar Çolak,et al. Vulnerability of Networks Against Critical Link Failures , 2010, ArXiv.
[49] R. Vohra,et al. Finding the most vital arcs in a network , 1989 .
[50] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..
[51] Rami Puzis,et al. Finding the most prominent group in complex networks , 2007, AI Commun..
[52] 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.
[53] Talal Rahwan,et al. A new approach to betweenness centrality based on the Shapley Value , 2012, AAMAS.
[54] W. Zachary,et al. An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.
[55] J. S. Mateo. The Shapley Value , 2012 .
[56] Roger B. Myerson,et al. Graphs and Cooperation in Games , 1977, Math. Oper. Res..
[57] Pablo M. Gleiser,et al. Community Structure in Jazz , 2003, Adv. Complex Syst..
[58] H. W. Corley,et al. Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..
[59] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[60] Eyal Winter. Chapter 53 The shapley value , 2002 .
[61] Noah E. Friedkin,et al. Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.
[62] Di Wu,et al. The Concept of Betweenness in the Analysis of Power Grid Vulnerability , 2010, 2010 Complexity in Engineering.
[63] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[64] Eitan Zemel,et al. Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..
[65] S. Borgatti,et al. The centrality of groups and classes , 1999 .
[66] Mark E. J. Newman. A measure of betweenness centrality based on random walks , 2005, Soc. Networks.
[67] G. Owen,et al. A game theoretic approach to measuring degree of centrality in social networks , 1982 .
[68] G. Caldarelli,et al. DebtRank: Too Central to Fail? Financial Networks, the FED and Systemic Risk , 2012, Scientific Reports.
[69] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[70] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[71] Luc Laeven,et al. Resolution of Banking Crises: The Good, the Bad, and the Ugly , 2010 .
[72] D. Monderer,et al. Variations on the shapley value , 2002 .
[73] Oskar Skibski,et al. A Shapley Value-based Approach to Determine Gatekeepers in Social Networks with Applications , 2014, ECAI.