Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games
暂无分享,去创建一个
Oskar Skibski | Talal Rahwan | Tomasz P. Michalak | Michael Wooldridge | M. Wooldridge | Talal Rahwan | Oskar Skibski
[1] J. Aczél,et al. Beiträge zur Theorie der geometrischen Objekte. VI , 1959 .
[2] Roger B. Myerson,et al. Graphs and Cooperation in Games , 1977, Math. Oper. Res..
[3] Mehmet Koyutürk,et al. Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network , 2014, AlCoB.
[4] Konstantin Avrachenkov,et al. Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.
[5] Dusit Niyato,et al. Cooperative Management in Full-Truckload and Less-Than-Truckload Vehicle System , 2017, IEEE Transactions on Vehicular Technology.
[6] Arvind Kumar,et al. Effect of edge pruning on structural controllability and observability of complex networks , 2015, Scientific Reports.
[7] Guillermo Owen,et al. Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..
[8] Gabrielle Demange,et al. A Survey of Network Formation Models: Stability and Efficiency , 2005 .
[9] Jesús Mario Bilbao,et al. Generating Functions for Computing the Myerson Value , 2002, Ann. Oper. Res..
[10] Edith Elkind,et al. Bounding the Cost of Stability in Games over Interaction Networks , 2013, AAAI.
[11] Victor R. Lesser,et al. A survey of multi-agent organizational paradigms , 2004, The Knowledge Engineering Review.
[12] Massimo Marchiori,et al. How the science of complex networks can help developing strategies against terrorism , 2004 .
[13] Gustavo Bergantiños,et al. Coalitional values and generalized characteristic functions , 1999, Math. Methods Oper. Res..
[14] Guillermo Owen,et al. Splitting graphs when calculating Myerson value for pure overhead games , 2004, Math. Methods Oper. Res..
[15] Zhu Han,et al. Coalitional game theory for communication networks , 2009, IEEE Signal Processing Magazine.
[16] Jürg Nievergelt,et al. The parallel search bench ZRAM and its applications , 1999, Ann. Oper. Res..
[17] Barbara Messing,et al. An Introduction to MultiAgent Systems , 2002, Künstliche Intell..
[18] Oskar Skibski,et al. Attachment Centrality for Weighted Graphs , 2017, IJCAI.
[19] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[20] Burleigh B. Gardner,et al. Deep South: A Social Anthropological Study of Caste and Class , 1942 .
[21] H. Duerr,et al. Tuning degree distributions: Departing from scale-free networks , 2007 .
[22] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[23] Oskar Skibski,et al. Axiomatic Characterization of Game-Theoretic Centrality , 2018, J. Artif. Intell. Res..
[24] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[25] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..
[26] José María Alonso-Meijide,et al. Monotonicity of power in weighted voting games with restricted communication , 2012, Math. Soc. Sci..
[27] Makoto Yokoo,et al. An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting , 2017, IEEE Intelligent Systems.
[28] Babak Heydari,et al. Fair Topologies: Community Structures and Network Hubs Drive Emergence of Fairness Norms , 2017, Scientific Reports.
[29] Edith Elkind,et al. Coalitional Games on Sparse Social Networks , 2014, WINE.
[30] Michael Wooldridge,et al. Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.
[31] Sarvapali D. Ramchurn,et al. Algorithms for Graph-Constrained Coalition Formation in the Real World , 2017, TIST.
[32] V. S. Subrahmanian,et al. Reshaping terrorist networks , 2014, CACM.
[33] Nicholas R. Jennings,et al. Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks , 2013, IJCAI.
[34] Oskar Skibski,et al. Algorithms for the shapley and myerson values in graph-restricted games , 2014, AAMAS.
[35] 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..
[36] Joseph Galaskiewicz,et al. Social Organization of an Urban Grants Economy: A Study of Business Philanthropy and Nonprofit Organizations , 1985 .
[37] Guido Moerkotte,et al. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products , 2006, VLDB.
[38] J. Hopcroft,et al. Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.
[39] Sarvapali D. Ramchurn,et al. On coalition formation with sparse synergies , 2012, AAMAS.
[40] Marc Sageman,et al. Understanding terror networks. , 2004, International journal of emergency mental health.
[41] Stephen J. Ressler. Social Network Analysis as an Approach to Combat Terrorism: Past, Present, and Future Research , 2006 .
[42] Guillermo Owen,et al. Centrality in directed social networks. A game theoretic approach , 2011, Soc. Networks.
[43] W. Zachary,et al. An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.
[44] Katia P. Sycara,et al. The RETSINA MAS Infrastructure , 2003, Autonomous Agents and Multi-Agent Systems.
[45] Oskar Skibski,et al. Defeating Terrorist Networks with Game Theory , 2015, IEEE Intelligent Systems.
[46] L. Shapley. A Value for n-person Games , 1988 .
[47] Berthe Y. Choueiry,et al. An Algorithm for Generating All Connected Subgraphs with k Vertices of a Graph , 2013 .
[48] Jesús Mario Bilbao. Values and potential of games with cooperation structure , 1998, Int. J. Game Theory.
[49] Valdis E. Krebs,et al. Mapping Networks of Terrorist Cells , 2001 .
[50] Makoto Yokoo,et al. Attachment Centrality: An Axiomatic Approach to Connectivity in Networks , 2016, AAMAS.
[51] Rafael Amer,et al. A connectivity game for graphs , 2004, Math. Methods Oper. Res..
[52] P. Erdos,et al. Some further statistical properties of the digits in Cantor's series , 1959 .
[53] Rafael Amer,et al. Accessibility in oriented networks , 2007, Eur. J. Oper. Res..
[54] A R Sharafat,et al. RECURSIVE CONTRACTION ALGORITHM: A NOVEL AND EFFICIENT GRAPH TRAVERSAL METHOD FOR SCANNING ALL MINIMAL CUT SETS , 2006 .
[55] N. Trinajstic,et al. The Zagreb Indices 30 Years After , 2003 .
[56] A. Nowak,et al. The Shapley Value for n-Person Games in Generalized Characteristic Function Form , 1994 .