Coalition Structure Generation with GRASP

The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involved in a system into disjoint coalitions. The problem of finding the optimal coalition structure is NP-complete. In order to find the optimal solution in a combinatorial optimization problem it is theoretically possible to enumerate the solutions and evaluate each. But this approach is infeasible since the number of solutions often grows exponentially with the size of the problem. In this paper we present a greedy adaptive search procedure (GRASP) to efficiently search the space of coalition structures in order to find an optimal one.

[1]  Nicholas R. Jennings,et al.  An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[2]  Nicholas R. Jennings,et al.  Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities , 2009, IJCAI.

[3]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

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

[5]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[6]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

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

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

[9]  S. Milne.  Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers , 1982 .

[10]  Jonas Mockus.  Bayesian Heuristic Approach to Discrete and Global Optimization: Algorithms, Visualization, Software, and Applications , 1996 .

[11]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[14]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[15]  J. L. Maryak,et al.  Bayesian Heuristic Approach to Discrete and Global Optimization , 1999, Technometrics.

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

[17]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

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

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