FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract)


  • Redha Taguelmimt LIRIS, Lyon 1 University
  • Samir Aknine LIRIS, Lyon 1 University
  • Djamila Boukredera Laboratory of Applied Mathematics, Faculty of Exact Sciences, University of Bejaia
  • Narayan Changder National Institute of Technology Durgapur


Coalition Structure Generation, Coalition Formation, Integer Partition Graph, Search Space Representation


In this paper, we propose a new algorithm for the Coalition Structure Generation (CSG) problem that can be run with more than 28 agents while using a complete set of coalitions as input. The current state-of-the-art limit for exact algorithms to solve the CSG problem within a reasonable time is 27 agents. Our algorithm uses a novel representation of the search space and a new code-based search technique. We propose an effective heuristic search method to efficiently explore the space of coalition structures using our code based technique and show that our method outperforms existing state-of-the-art algorithms by multiple orders of magnitude.




How to Cite

Taguelmimt, R., Aknine, S., Boukredera, D., & Changder, N. (2021). FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 35(18), 15907-15908. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/17950



AAAI Student Abstract and Poster Program