Home > Articles > Published articles > Coalition structure generation problems : |
Date: | 2017 |
Abstract: | The coalition structure generation problem is well known in the area of multi-agent systems. Its goal is to establish coalitions between agents while maximizing the global welfare. Among the existing different algorithms designed to solve the coalition structure generation problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the operation of the dynamic programming and improved dynamic programming algorithms, we have identified which are the most frequent operations and propose an optimized method. In addition, we study and implement a method for dividing the work into different threads. To describe incremental improvements of the algorithm design, we first compare performance of an improved single central processing unit core version where we obtain speedups ranging from 7 × to 11 × . Then, we describe the best resource use in a multi-thread optimized version where we obtain an additional 7. 5 × speedup running in a 12-core machine. |
Grants: | Ministerio de Ciencia e Innovación TIN2014-53234-C2-1-R Ministerio de Ciencia e Innovación TIN2015-66863-C2-1-R Agència de Gestió d'Ajuts Universitaris i de Recerca 2014/SGR-576 Agència de Gestió d'Ajuts Universitaris i de Recerca 2014/SGR-118 |
Rights: | Tots els drets reservats. |
Language: | Anglès |
Document: | Article ; recerca ; Versió acceptada per publicar |
Subject: | Dynamic programming ; Multi agent systems ; Multi-core systems ; Set partitioning problem |
Published in: | Concurrency and Computation : Practice and Experience, Vol. 29, Issue 5 (March 2017) , art. e3969, ISSN 1532-0626 |
Postprint 21 p, 1.3 MB |