• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Cheng Bailiang, Zeng Guosun, Jie Anquan. Study of Multi-Agent Trust Coalition Based on Self-Organization Evolution[J]. Journal of Computer Research and Development, 2010, 47(8): 1382-1391.
Citation: Cheng Bailiang, Zeng Guosun, Jie Anquan. Study of Multi-Agent Trust Coalition Based on Self-Organization Evolution[J]. Journal of Computer Research and Development, 2010, 47(8): 1382-1391.

Study of Multi-Agent Trust Coalition Based on Self-Organization Evolution

More Information
  • Published Date: August 14, 2010
  • Different from the existing game theory used in multi-agent coalition, this paper studies it from coalition trust. The trust degree of individual is built on history cooperating information and then the trust degree of coalition is built above it for trusting coalition. To finish more complex task, some small coalitions unite to a large coalition by coalition trust and competitive negotiation. This way makes trust run through the total process of evolvement of coalition with describing the self-organization of evolvement. In order to get stable coalition, the free competition and trust evaluation is used for distributing income among coalition. For the effective and fair distributing mechanism, the frame behavior in free competition will be eliminated by amending trust degree with the protection of private data after distributing income. Using trust, the produce structure and evolution process of coalition is described and the stable coalition is obtained by fair income distribution with private protection. The distributed cooperation model is built and the computing complex is reduced greatly by coalition trust with controllable venture income. Trust coalition will provide an effective guarantee for dynamic coalition.
  • Related Articles

    [1]Chen Yewang, Shen Lianlian, Zhong Caiming, Wang Tian, Chen Yi, Du Jixiang. Survey on Density Peak Clustering Algorithm[J]. Journal of Computer Research and Development, 2020, 57(2): 378-394. DOI: 10.7544/issn1000-1239.2020.20190104
    [2]Wang Haiyan, Xiao Yikang. Dynamic Group Discovery Based on Density Peaks Clustering[J]. Journal of Computer Research and Development, 2018, 55(2): 391-399. DOI: 10.7544/issn1000-1239.2018.20160928
    [3]Fan Zhiqiang and Zhao Qinping. A Data-Clustering Based Robust SIFT Feature Matching Method[J]. Journal of Computer Research and Development, 2012, 49(5): 1123-1129.
    [4]Yu Canling, Wang Lizhen, and Zhang Yuanwu. An Enhancement Algorithm of Cluster Boundaries Precision Based on Grid's Density Direction[J]. Journal of Computer Research and Development, 2010, 47(5): 815-823.
    [5]Ma Haitao, Hao Zhongxiao, Zhu Yan. Checking Active XML Validation[J]. Journal of Computer Research and Development, 2008, 45(9): 1554-1560.
    [6]Chen Jianmei, Lu Hu, Song Yuqing, Song Shunlin, Xu Jing, Xie Conghua, Ni Weiwei. A Possibility Fuzzy Clustering Algorithm Based on the Uncertainty Membership[J]. Journal of Computer Research and Development, 2008, 45(9): 1486-1492.
    [7]Lü Zonglei, Wang Jiandong, Li Ying, and Zai Yunfeng. An Index of Cluster Validity Based on Modal Logic[J]. Journal of Computer Research and Development, 2008, 45(9): 1477-1485.
    [8]Jin Jun and Zhang Daoqiang. Semi-Supervised Robust On-Line Clustering Algorithm[J]. Journal of Computer Research and Development, 2008, 45(3): 496-502.
    [9]Ding Shifei, Shi Zhongzhi, Jin Fengxiang, Xia Shixiong. A Direct Clustering Algorithm Based on Generalized Information Distance[J]. Journal of Computer Research and Development, 2007, 44(4): 674-679.
    [10]Yue Shihong, Wang Zhengyou. Bisecting Grid-Based Clustering Approach and Its Validity[J]. Journal of Computer Research and Development, 2005, 42(9): 1505-1510.

Catalog

    Article views (697) PDF downloads (477) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return