Grasp and Path-Relinking for Coalition Structure Generation

In Artificial Intelligence with Coalition Structure Generation CSG one refers to those cooperative complex problems that require to find an optimal partition maximizing a social welfare of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning set covering machines, clustering, Data Mining decision tree, discretization, Graph Theory, Natural Language Processing aggregation, Semantic Web service composition, and Bioinformatics. The problem of finding the optimal coalition structure is NP-complete. In this paper we present a greedy adaptive search procedure GRASP with path-relinking to efficiently search the space of coalition structures. Experiments and comparisons to other algorithms prove the validity of the proposed method in solving this hard combinatorial problem.

[1]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[2]  Mirella Lapata,et al.  Aggregation via Set Partitioning for Natural Language Generation , 2006, NAACL.

[3]  Elisa Bertino,et al.  State-of-the-art in privacy preserving data mining , 2004, SGMD.

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

[5]  Sinh Hoa Nguyen,et al.  On Finding Optimal Discretizations for Two Attributes , 1998, Rough Sets and Current Trends in Computing.

[6]  Usama M. Fayyad,et al.  The Attribute Selection Problem in Decision Tree Generation , 1992, AAAI.

[7]  Wei Zhang,et al.  An anytime algorithm for optimal coalition structure generation , 2010, 2010 Sixth International Conference on Natural Computation.

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

[9]  Andreas Witzel,et al.  A Generic Approach to Coalition Formation , 2007, IGTR.

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

[11]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

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

[13]  Lior Rokach,et al.  Privacy-preserving data mining: A feature set partitioning approach , 2010, Inf. Sci..

[14]  Lior Rokach,et al.  Theory and applications of attribute decomposition , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

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

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

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

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

[19]  Lior Rokach,et al.  Decomposition methodology for classification tasks: a meta decomposer framework , 2006, Pattern Analysis and Applications.

[20]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

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

[22]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

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

[24]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

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

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

[27]  Carla E. Brodley,et al.  Solving cluster ensemble problems by bipartite graph partitioning , 2004, ICML.

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

[29]  Celso C. Ribeiro,et al.  Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications , 2010 .

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

[31]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

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

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