Coalition structure generation with worst case guarantees
Artificial Intelligence
Introduction to Algorithms
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Anytime optimal coalition structure generation
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Near-optimal anytime coalition structure generation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Methods for task allocation via agent coalition formation
Artificial Intelligence
| Hi-index | 0.00 |
In the field of multi-agent systems, the coalition strncture generation problem is extremely challenging due to the exponential number of partitions that need to be examined. What kind of appearance the space of coalition structure is, there is few man to research it. This paper take the space of coalition structure as a coalition structure graph, give four properties of OCS(optimal coalition structure) model: optimal substructure, overlapping subproblems, minimal searching set, redundancy paths to OCS, using these properties, we devise an Efficient Dynamic Programming (EDP) algorithm that perform fewer operations than DP (Dynamic Programming), because it needn't evaluate the splits of coalition whose size is greater ⌈2n/3⌉. Finally, we prove that upper bound of EDP time complexity is O(3n). Experiment analysis shows the validity of the proposed algorithm, because it performs fewer operations which save 42% time than DP (given 21 agents).