By Topic

A coalition structure generation algorithm based on partition cardinality structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hai-Yan Wu ; Coll. of Math. & Comput. Sci., Fujian Normal Univ., Fuzhou, China ; Shan-Li Hu

Coalition formation is a key topic on multi-agent systems. As the number of coalition structures is large, it is not allowed to search the whole coalition structure tree exhaustively. So, a partial search which is guaranteed to be within a bound from optimum is interested. A large number of previous work has been done to find the optimal coalition structure in Characteristic Function Games (CFGs), where the value of a coalition was independent from co-existing coalitions in the system. However, usually it is not appropriate to the real situation because an agent's effectiveness may change from one coalition structure to another. Thus, much more general Partition Function Games (PFGs) have to be applied. In this context, we develop an algorithm based on partition cardinality structure, which consider the coalition value in PFGs. We use different strategies in two classes of PFGs, and improve the bound with further search.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:3 )

Date of Conference:

29-31 Oct. 2010