Coalition structure generation with given required bound based on coalition combination
Jianbin Luo · Fuzhou daxue xuebao. Ziran kexue ban · 2011
Analyzes the relations among coalition structures in depth and presents on a novel algorithm based on coalition combination(the bound k(n)≥2 can be attained) that only have to take a step further to search those coalition structures whose is in the coalition combination cardinality structure set CCCS(n,k).Finally,experiments show that the new algorithm is obviously better than existing algorithms.