An Anytime Coalition Structure Generation Algorithm
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Coalition formation is a key topic in multi agent systems. People try to search for coalition structure that maximizes the sum of the values of the coalitions, but in most cases the number of coalition structures is too large to search for the optimal one exhaustively. In this paper, an algorithm is presented that within the minimal amount of search can guarantee to find a coalition structure which is within a bound from optimum. Then, the anytime algorithm searches further, and establishes a progressively lower bound, and lowers the bound rapidly.In this stage, it evidently outperforms the algorithm presented by Sandholm etc, which is the new-made better result in this area.

    Reference
    Related
    Cited by
Get Citation

胡山立,石纯一.一种任一时间联盟结构生成算法.软件学报,2001,12(5):729-734

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 13,1999
  • Revised:October 28,1999
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063