Agent主观信任的传递性  

Transitivity of Agent Subjective Trust

作　　者：童向荣[1] 张伟[1] 龙宇[1] 

机构地区：[1]烟台大学计算机学院,山东烟台264005

出　　处：《软件学报》2012年第11期2862-2870,共9页Journal of Software

基　　金：国家自然科学基金(61170224;60973075);国家重点基础研究发展计划(973)(2007CB307100);山东省自然科学基金(ZR2011FL018;ZR2012FL07);山东省科技发展计划(2012GGB01017);山东省教育厅科技计划(J11LG35;J10LG27)

摘　　要：信任在多Agent系统和网络研究中越来越引起重视.主观信任一般不具备对称性和传递性,这就为基于信任的委托、信任网络的构建和基于信任的网络信息传播等带来了很大的不确定性.针对此问题,讨论了合作环境下二值信任关系及其传递性.给出了客观信任、主观信任的建模方法,给出了与信任传递性有关的几个性质,并证明了客观信任具有等价关系,而主观信任则只具备有条件的对称性和传递性,研究了构造主观信任传递闭包的可行算法,讨论了主观信任传递闭包的连通性及其测试算法,这几种算法的计算复杂度都是多项式级的.为主观信任的传递性研究做了初步的探索,给出了几个基本结论.Researches on trust have attracted more and more attentions in multi-agent systems and networks. However, subjective trust generally has no transitivity, which brings much non-determination on delegation, network information propagation, and the construction of subjective trust network. To this end, the paper discusses the binary value of trust relation, and its transitivity in cooperative environment. First, the study gives the definition of objective trust and subjective trust. Next, the paper proposes some useful properties of trust related to the transitivity of trust and demonstrates that objective trust has a relation of equivalence, and subjective trust has a relation of constrained symmetry and transitivity. Finally, a feasible algorithm of subjective trust closure and test algorithms for connectedness are given, and the study has demonstrated that the computational complexities of the above algorithms are polynomial order. The paper made some initial explores on transitivity of subjective trust and gives some useful basic conclusions.

关 键 词：多AGENT 系统 信任 传递性 闭包 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]