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 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.

关键词： Multiagent system Coalition structure Cardinality structure

作者: SHE-XIONG SU SHAN-LI HU SHENT-FU ZHENG CHAO-FENG LIN XIAN-WEI LAI

作者单位: Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, China Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, China;Key Laborator

会议类型: 国际会议

会议名称: 2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

会议地点: 香港

会议语种:英文

页码: 2505-2510

在线出版日期: 2007-08-19（万方平台首次上网日期，不代表论文的发表时间）