Forming k coalitions and facilitating relationships in social networks
暂无分享,去创建一个
Sarit Kraus | Michael Wooldridge | Noam Hazon | Liat Sless | Sarit Kraus | M. Wooldridge | Noam Hazon | Liat Sless
[1] Dorit S. Hochbaum,et al. A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..
[2] Rami Puzis,et al. Organization Mining Using Online Social Networks , 2013, ArXiv.
[3] Nicholas R. Jennings,et al. Coalitional stability in structured environments , 2012, AAMAS.
[4] Michael R. Fellows,et al. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.
[5] Onn Shehory,et al. Coalition structure generation with worst case guarantees , 2022 .
[6] Sarit Kraus,et al. Forming coalitions and facilitating relationships for completing tasks in social networks , 2014, AAMAS.
[7] Christos Faloutsos,et al. Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..
[8] Martin Hoefer,et al. Hedonic Coalition Formation in Networks , 2015, AAAI.
[9] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[10] Shao Chin Sung,et al. On core membership testing for hedonic coalition formation games , 2007, Oper. Res. Lett..
[11] Luca Becchetti,et al. Online team formation in social networks , 2012, WWW.
[12] Michael Wooldridge,et al. Hedonic coalition nets , 2009, AAMAS.
[13] C. D. De Dreu,et al. Task versus relationship conflict, team performance, and team member satisfaction: a meta-analysis. , 2003, The Journal of applied psychology.
[14] Nicholas R. Jennings,et al. Coalition Structure Generation over Graphs , 2012, J. Artif. Intell. Res..
[15] Simina Brânzei,et al. Social Distance Games , 2011, IJCAI.
[16] Paul Harrenstein,et al. Fractional Hedonic Games , 2014, AAMAS.
[17] Jörg Rothe,et al. The Cost of Stability in Coalitional Games , 2009, SAGT.
[18] Felix Brandt,et al. Optimal Partitions in Additively Separable Hedonic Games , 2011, IJCAI.
[19] Morteza Zadimoghaddam,et al. Optimal Coalition Structure Generation in Cooperative Graph Games , 2013, AAAI.
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] Bernhard Schölkopf,et al. Structure and dynamics of information pathways in online media , 2012, WSDM.
[22] Bernhard Schölkopf,et al. Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.
[23] Yingqian Zhang,et al. Multiagent task allocation in social networks , 2011, Autonomous Agents and Multi-Agent Systems.
[24] Jeffrey S. Rosenschein,et al. Subsidies, Stability, and Restricted Cooperation in Coalitional Games , 2011, IJCAI.
[25] Zhu Han,et al. A selfish approach to coalition formation among unmanned air vehicles in wireless networks , 2009, 2009 International Conference on Game Theory for Networks.
[26] Laura Sanità,et al. Stabilizing network bargaining games by blocking players , 2018, Math. Program..
[27] Eyal Winter,et al. Stability and Segregation in Group Formation , 2002, Games Econ. Behav..
[28] Jochen Könemann,et al. Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances , 2012, Theory of Computing Systems.
[29] Marie desJardins,et al. Agent-organized networks for dynamic team formation , 2005, AAMAS '05.
[30] Jeffrey S. Rosenschein,et al. Coalitional skill games , 2008, AAMAS.
[31] Tsuyoshi Murata,et al. {m , 1934, ACML.
[32] Giovanni Rinaldi,et al. Easy and difficult objective functions for max cut , 2003, Math. Program..
[33] Sarit Kraus,et al. Solving coalitional resource games , 2010, Artif. Intell..
[34] Michael Wooldridge,et al. Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.
[35] Laurie R. Weingart,et al. TASK VERSUS RELATIONSHIP CONFLICT: A META-ANALYSIS. , 2002 .
[36] Gabriel Kliot,et al. Streaming graph partitioning for large distributed graphs , 2012, KDD.
[37] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[38] Éva Tardos,et al. Balanced outcomes in social exchange networks , 2008, STOC.
[39] Simina Brânzei,et al. Coalitional affinity games , 2009, AAMAS.