通过分析联盟之间的关系,提出了基于联盟组合的给定限界联盟结构生成算法.根据给定的限界k(n)≥2,在搜索最底两层及顶层后,只要再搜索联盟组合势结构CCCS(n,k)对应的联盟结构就能达到给定的限界,并给出构造对应联盟结构的方法.
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.