一种基于tit-for-tat策略的伪度优先算法  

A Pseudo Value First Algorithm Based on Tit-for-Tat Strategy

作　　者：李涛[1] 林冬梅[1] 王伊蕾[2] 孙中红[1] 

机构地区：[1]鲁东大学现代教育技术部,山东烟台264025 [2]鲁东大学信息科学与工程学院,山东烟台264025

出　　处：《数学的实践与认识》2010年第16期8-13,共6页Mathematics in Practice and Theory

基　　金：鲁东大学校基金(L20086301)

摘　　要：复杂网络中的两个节点,随着时间的推移,由于利益冲突,可能会采取一些行动,合作或者背叛,对于背叛过多的节点,需要断开重连,这也恰好反映了现实情况.根据重复博弈中的tit-for-tat策略,提出了一种伪度优先算法,研究了在不改变节点个数情况下,复杂网络的统计特性.仿真结果表明,该算法并不改变网络的无标度特征,但是改变了最大度的节点分布,并且大大提高了网络的聚集系数.另外,还研究了对网络社团结构的影响,结果表明可以优化网络的社团结构.With time goes by, two nodes in complex network may adopt some actions for some conflicts of interests and they may either cooperate or detect their neighbors. For the node who detect most, its neighbor tends to cut their relationship and re-connect a new neighbor, this situation fit for real world. This paper puts forward a new pseudo value first algorithm based on tit-for-tat strategy in game theory and studies the network statistic characters with the network nodes unchanged. The simulation results show that the new algorithm cannot change scale free character but can change the maximum value in network and its clustering coefficient. On the other hand, we also study the effect of this new algorithm on network community structure, results show it can optimize the community structure.

关 键 词：囚徒困境 TIT-FOR-TAT NASH均衡 复杂网络 

分 类 号：O157.5[理学—数学]