Coalition Structure Generation with Given Required Bound Based on Cardinality Structure

Coalition formation is a key topic in multi-agent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition...

Full description

Saved in:
Bibliographic Details
Main Authors: Su, She-Xiong, Hu, Shan-Li, Zheng, Shent-Fu, Lin, Chao-Feng, Lai, Xian-Wei
Format: Conference Proceeding
Language:English
Subjects:
Autonomous agents
Cardinality structure
Chaos
Coalition structure
Computer science
Cybernetics
Electronic mail
Grid computing
Laboratories
Machine learning
Multiagent system
Multiagent systems
Resource management
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Coalition formation is a key topic in multi-agent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition structure is NP-hard. Thus emerges the meaningful problem: when practical applications can present required real bound on the worst case, and how to attain this demand via partial search? This paper reports on a novel algorithm based on cardinality structure: the bound K≥2 can be attained with searching of those coalition structures whose cardinality structure is in the CCS(n, K). Finally, experiments indicates the new algorithm is obviously better than existing algorithms.
ISSN:2160-133X
DOI:10.1109/ICMLC.2007.4370568