• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Jindi, Tong Xiangrong. Agent Negotiation Model Based on Round Limit Change of Non-Sparse Trust Networks[J]. Journal of Computer Research and Development, 2019, 56(12): 2612-2622. DOI: 10.7544/issn1000-1239.2019.20190163
Citation: Wang Jindi, Tong Xiangrong. Agent Negotiation Model Based on Round Limit Change of Non-Sparse Trust Networks[J]. Journal of Computer Research and Development, 2019, 56(12): 2612-2622. DOI: 10.7544/issn1000-1239.2019.20190163

Agent Negotiation Model Based on Round Limit Change of Non-Sparse Trust Networks

More Information
  • Published Date: November 30, 2019
  • In the process of multiple Agent negotiation, trust value attracted less attention in related works. In fact, trust value will directly affect the utility and strategy of negotiation. Most of previous works researched direct trust. However, it will lead to the sparse of trust relationship matrix if lacks the direct trust relationship, which may reduce the using efficiency of trust relationships. In addition, most related works ignored the influence of trust on negotiation strategy and negotiation rounds. According to the problems, this paper considers the indirect trust and direct trust through trust transfer to form a non-sparse trust network. Therefore, Agent could select reliable negotiation rivals based on the trust values of bidders. Facing the negotiation rivals with different trust values, Agent will adopt different strategies. The paper improves the round limit function and bidding function in negotiation model. Agent will pay more patience to the rivals with high trust values. Therefore, the round limit and bidding space will be extended and bidding will be properly increased, while the rivals with low trust values will be conducted reverse operations. Comparison experiments prove that new model is more reliable than those models that do not consider trust attribute. The negotiation model has better performance on success rate and utility of negotiation.
  • Related Articles

    [1]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [2]Zhang Tianming, Zhao Jie, Jin Lu, Chen Lu, Cao Bin, Fan Jing. Vertex Betweenness Centrality Computation Method over Temporal Graphs[J]. Journal of Computer Research and Development, 2023, 60(10): 2383-2393. DOI: 10.7544/issn1000-1239.202220650
    [3]Zhu Xia, Luo Junzhou, Song Aibo, and Dong Fang. A Multi-Dimensional Indexing for Complex Query in Cloud Computing[J]. Journal of Computer Research and Development, 2013, 50(8): 1592-1603.
    [4]Wang Zhuxiao, Hu Hong, Chen Limin, Shi Zhongzhi. Parallel Computation Techniques for Dynamic Description Logics Reasoning[J]. Journal of Computer Research and Development, 2011, 48(12): 2317-2325.
    [5]Zhang Yu, Liu Ping, Liu Yanbing, Tan Jianlong, Guo Li. Algorithmic Complexity Attacks Against WuManber[J]. Journal of Computer Research and Development, 2011, 48(8): 1381-1389.
    [6]Lu Jiyuan, Zhang Peizhao, Duan Xiaohua, Chao Hongyang. An Optimized Motion Estimation Algorithm Based on Macroblock Priorities[J]. Journal of Computer Research and Development, 2011, 48(3): 494-500.
    [7]Lin Xin, Li Shanping, Yang Zhaohui, Xu Jian. A Reasoning-Oriented Context Replacement Algorithm in Pervasive Computing[J]. Journal of Computer Research and Development, 2009, 46(4): 549-557.
    [8]Huang Han, Hao Zhifeng, Qin Yong. Time Complexity of Evolutionary Programming[J]. Journal of Computer Research and Development, 2008, 45(11): 1850-1857.
    [9]Tian Mei, Luo Siwei, Huang Yaping, and Zhao Jiali. Extracting Bottom-Up Attention Information Based on Local Complexity and Early Visual Features[J]. Journal of Computer Research and Development, 2008, 45(10): 1739-1746.
    [10]Pan Rui, Zhu Daming, and Ma Shaohan. Research on Computational Complexity and Approximation Algorithm for General Facility Location Problem[J]. Journal of Computer Research and Development, 2007, 44(5): 790-797.

Catalog

    Article views (770) PDF downloads (226) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return