一种基于完全信息扩展博弈的自动信任协商策略  

A Dynamic Game Based Automated Trust Negotiation Model

作　　者：黄宇[1,2] 曾国荪[1,2] 袁禄来[1,2] 

机构地区：[1]同济大学计算机科学及技术系,上海201804 [2]国家高性能计算机工程技术中心同济分中心,上海201804

出　　处：《微电子学与计算机》2009年第10期21-24,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(60673157);国家"八六三"计划项目(2007AA01Z425);国家"九七三"计划项目前期研究专项(2007CB316502)

摘　　要：提出了一个基于完全信息扩展博弈的自动信任协商策略,该策略依据子博弈精炼纳什均衡来制定.首先,通过分析比较,将自动信任协商过程转化为完全信息扩展博弈过程,重点讨论了信任博弈树的构造算法和支付函数的计算方法;然后讨论了协商双方效用函数的计算,以此为基础提出了一种新的自动信任协商策略,按照该协商策略进行协商可以使协商双方利益最大化.In this paper we model the ATN process as an Extensive Game with Perfect Information （EGPI） and conclude that the equilibrium of the game is the most desirable result of the ATN process. A EGPI based ATN is modeled as a quadruple. After the model is presented, the algorithm of building a Trust Game Tree and the method to calculate the payoff function is heavily discussed. Then the subgame perfect equilibrium set is found using the technique of Backward Induction. The ATN model presented in this paper can effectively prevent the privacy of negotiators from unnecessary exposure and save negotiation time by lesser exchange of credentials.

关 键 词：自动信任协商 完全信息扩展博弈 子博弈精炼纳什均衡 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]