Monte-Carlo Tree Search for Scalable Coalition Formation

We propose a novel algorithm based on MonteCarlo tree search for the problem of coalition structure generation (CSG). Specifically, we find the optimal solution by sampling the coalition structure graph and incrementally expanding a search tree, which represents the partial space that has been searched. We prove that our algorithm is complete and converges to the optimal given sufficient number of iterations. Moreover, it is anytime and can scale to large CSG problems with many agents. Experimental results on six common CSG benchmark problems and a disaster response domain confirm the advantages of our approach comparing to the state-of-the-art methods.

[1]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[2]  Tuomas Sandholm,et al.  Anytime coalition structure generation: an average case study , 1999, AGENTS '99.

[3]  Steven Reece,et al.  Human–agent collaboration for disaster response , 2015, Autonomous Agents and Multi-Agent Systems.

[4]  Nicholas R. Jennings,et al.  Generating coalition structures with finite bound from the optimal guarantees , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  Sarvapali D. Ramchurn,et al.  C-Link: A Hierarchical Clustering Approach to Large-scale Near-optimal Coalition Formation , 2013, IJCAI.

[6]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[7]  Nicholas R. Jennings,et al.  A hybrid exact algorithm for complete set partitioning , 2016, Artif. Intell..

[8]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[9]  D. Yun Yeh,et al.  A Dynamic Programming Approach to the Complete Set Partitioning Problem , 1986, BIT.

[10]  Sarvapali D. Ramchurn,et al.  Coalition structure generation problems: optimization and parallelization of the IDP algorithm in multicore systems , 2017, Concurr. Comput. Pract. Exp..

[11]  Nicholas R. Jennings,et al.  Coalition structure generation: A survey , 2015, Artif. Intell..

[12]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[13]  Helena Keinänen,et al.  Simulated Annealing for Multi-agent Coalition Formation , 2009, KES-AMSTA.

[14]  Julie A. Adams,et al.  Coalition formation for task allocation: theory and algorithms , 2011, Autonomous Agents and Multi-Agent Systems.

[15]  Demis Hassabis,et al.  Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[16]  Sarvapali D. Ramchurn,et al.  Coalition structure generation with the graphics processing unit , 2014, AAMAS.

[17]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[18]  Stefano Ferilli,et al.  Coalition Structure Generation with GRASP , 2010, AIMSA.

[19]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[20]  Sarvapali D. Ramchurn,et al.  A hierarchical clustering approach to large-scale near-optimal coalition formation with quality guarantees , 2017, Eng. Appl. Artif. Intell..

[21]  Sarvapali D. Ramchurn,et al.  Anytime Optimal Coalition Structure Generation , 2007, AAAI.

[22]  Sarvapali D. Ramchurn,et al.  A cooperative game-theoretic approach to the social ridesharing problem , 2017, Artif. Intell..

[23]  Nicholas R. Jennings,et al.  A Hybrid Algorithm for Coalition Structure Generation , 2012, AAAI.

[24]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.