Code-based Algorithm for Coalition Structure Generation

Finding the optimal coalition structure is an NP-complete problem that is computationally challenging even under quite restrictive assumptions. In this paper, we propose a new algorithm for the Coalition Structure Generation (CSG) problem, which provides good enough quality solutions and that can be...

Full description

Saved in:
Bibliographic Details
Published inProceedings - International Conference on Tools with Artificial Intelligence, TAI pp. 1075 - 1082
Main Authors Taguelmimt, Redha, Aknine, Samir, Boukredera, Djamila, Changder, Narayan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2021
Subjects
Artificial intelligence
Coalition formation
Coalition structure generation
Codes
Conferences
FACS
Heuristic algorithms
Integer partition graph
NP-complete problem
Search methods
Space exploration
Online AccessGet full text
ISSN2375-0197
DOI10.1109/ICTAI52525.2021.00170

Cover

More Information
Summary:Finding the optimal coalition structure is an NP-complete problem that is computationally challenging even under quite restrictive assumptions. In this paper, we propose a new algorithm for the Coalition Structure Generation (CSG) problem, which provides good enough quality solutions and that can be run with hundreds of agents. The Fast code-based Algorithm for Coalition Structure generation (FACS) uses a novel representation of the search space of coalition structures and a new code-based search technique. We devise an effective heuristic search method to efficiently explore the space of coalition structures using our code-based technique. Results show that our method outperforms existing state-of-the-art algorithms by multiple orders of magnitude while providing high-quality solutions.
ISSN:2375-0197
DOI:10.1109/ICTAI52525.2021.00170