Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract)

Authors

  • Redha Taguelmimt LIRIS Lab., Lyon 1 University
  • Samir Aknine LIRIS Lab., Lyon 1 University
  • Djamila Boukredera Laboratory of Applied Mathematics, Faculty of Exact Sciences, University of Bejaia
  • Narayan Changder TCG Centres for Research and Education in Science and Technology, Kolkata

DOI:

https://doi.org/10.1609/aaai.v37i13.27033

Keywords:

Coalition Structure Generation, Coalition Formation, Integer Partition Graph, Index-based Representation

Abstract

In this paper, we propose a novel algorithm to address the Coalition Structure Generation (CSG) problem. Specifically, we use a novel representation of the search space that enables it to be explored in a new way. We introduce an index-based exact algorithm. Our algorithm is anytime, produces optimal solutions, and can be run on large-scale problems with hundreds of agents. Our experimental evaluation on a benchmark with several value distributions shows that our representation of the search space that we combined with the proposed algorithm provides high-quality results for the CSG problem and outperforms existing state-of-the-art algorithms.

Downloads

Published

2024-07-15

How to Cite

Taguelmimt, R., Aknine, S., Boukredera, D., & Changder, N. (2024). Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 37(13), 16346-16347. https://doi.org/10.1609/aaai.v37i13.27033