Code-based Algorithm for Coalition Structure Generation

Taguelmimt, Redha; Aknine, Samir; Boukredera, Djamila; Changder, Narayan

doi:10.1109/ictai52525.2021.00170

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We adapt the representation presented in [18] to the configurations of I 3 . For each configuration, we represent each coalition with its index.…”

Section: Coalition Representationmentioning

confidence: 99%

“…Similar to [18], we represent each coalition structure with a vector of indexes of size n = |A|: [x 1 , x 2 , .., x p , .., x n ]. The indexes in positions 1, 2, .…”

Section: Ordered Coalition Structure Representationmentioning

confidence: 99%

“…We design a new search space representation for the SCSGA problem. Specifically, we borrow ideas from the research [18], which has been successful in quickly solving the coalition structure gen-eration problem, and represent coalitions of agents as indexes that indicate both the coalition to which agents belong and the task assigned to them. Additionally, we partition the solution space into smaller subspaces.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Anytime Index-Based Search Method for Large-Scale Simultaneous Coalition Structure Generation and Assignment

Taguelmimt,

Aknine,

Boukredera

et al. 2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

Organizing agents into disjoint groups is a crucial challenge in artificial intelligence, with many applications where quick runtime is essential. The Simultaneous Coalition Structure Generation and Assignment (SCSGA) problem involves partitioning a set of agents into coalitions and assigning each coalition to a task, with the goal of maximizing social welfare. However, this is an NP-complete problem, and only a few algorithms have been proposed to address it for both small and large-scale problems. In this paper, we address this challenge by presenting a novel algorithm that can efficiently solve both small and large instances of this problem. Our method is based on a new search space representation, where each coalition is codified by an index. We have developed an algorithm that can explore this solution space effectively by generating index vectors that represent coalition structures. The resulting algorithm is anytime and can scale to large problems with hundreds or thousands of agents. We evaluated our algorithm on a range of value distributions and compared its performance against state-of-the-art algorithms. Our experimental results demonstrate that our algorithm outperforms existing methods in solving the SCSGA problem, providing high-quality solutions for a wide range of problem instances.

show abstract

“…We adapt the representation presented in [18] to the configurations of I 3 . For each configuration, we represent each coalition with its index.…”

Section: Coalition Representationmentioning

confidence: 99%

“…Similar to [18], we represent each coalition structure with a vector of indexes of size n = |A|: [x 1 , x 2 , .., x p , .., x n ]. The indexes in positions 1, 2, .…”

Section: Ordered Coalition Structure Representationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Anytime Index-Based Search Method for Large-Scale Simultaneous Coalition Structure Generation and Assignment

Taguelmimt,

Aknine,

Boukredera

et al. 2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

show abstract

“…The index-based representation comes with the idea of representing the space of coalition structures using integers. We rely on the representation presented in [Taguelmimt et al 2021]. It presents a higher layer above an integer partition (IP) graph defined initially in [Rahwan et al 2007], which divides the space of coalition structures into subspaces that are each represented by an integer partition Copyright © 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org).…”

Section: Index-based Representationmentioning

confidence: 99%

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

Taguelmimt

Aknine

Boukredera

et al. 2023

AAAI

View full text Add to dashboard Cite

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.

show abstract

Research on the Coalition Formation of Multi-Agent Systems for Forest Fire Prevention and Control Tasks

Wu,

Zhang,

Xin

2024

2024 IEEE 18th International Conference on Control &Amp;amp; Automation (ICCA)

View full text Add to dashboard Cite

Code-based Algorithm for Coalition Structure Generation

Cited by 5 publications

References 10 publications

Anytime Index-Based Search Method for Large-Scale Simultaneous Coalition Structure Generation and Assignment

Anytime Index-Based Search Method for Large-Scale Simultaneous Coalition Structure Generation and Assignment

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

Research on the Coalition Formation of Multi-Agent Systems for Forest Fire Prevention and Control Tasks

Contact Info

Product

Resources

About