Simulated Annealing for Multi-agent Coalition Formation

We present a simulated annealing algorithm for coalition formation represented as characteristic function games. We provide a detailed analysis of various neighbourhoods for the algorithm, and of their effects to the algorithm's performance. Our practical experiments and comparisons with other methods demonstrate that simulated annealing provides a useful tool to tackle the combinatorics involved in multi-agent coalition formation.

[1]  Jingan Yang,et al.  Coalition formation mechanism in multi-agent systems based on genetic algorithms , 2007, Appl. Soft Comput..

[2]  Nicholas R. Jennings,et al.  Coalition Structure Generation : Dynamic Programming Meets Anytime Optimization , 2008 .

[3]  Anatol Rapoport,et al.  Theories of Coalition Formation , 1998 .

[4]  Tuomas Sandholm,et al.  Anytime coalition structure generation: an average case study , 2000, J. Exp. Theor. Artif. Intell..

[5]  Nicholas R. Jennings,et al.  Coalition Structure Generation in Task-Based Settings , 2006, ECAI.

[6]  Sandip Sen,et al.  Searching for optimal coalition structures , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

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

[8]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Misa Keinänen,et al.  Simulated Annealing for Coalition Formation , 2008, ECAI.

[12]  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..

[13]  Brian W. Kernighan,et al.  The C Programming Language , 1978 .