作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (8): 270-271. doi: 10.3969/j.issn.1000-3428.2010.08.094

• 开发研究与设计技术 • 上一篇    下一篇

网络演化中讨价还价策略的研究

王伊蕾1,2,李 涛3,田生文1,徐秋亮2   

  1. (1. 鲁东大学计算机科学与技术学院,烟台 264025;2. 山东大学计算机科学与技术学院,济南 250101;3. 鲁东大学网络中心,烟台 264025)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-04-20 发布日期:2010-04-20

Research on Tit-for-Tat Tactics in Network Evolvement

WANG Yi-lei1,2, LI Tao3, TIAN Sheng-wen1, XU Qiu-liang2   

  1. (1. School of Computer Science & Technology, Ludong University, Yantai 264025;2. School of Computer Science & Technology, Shandong University, Jinan 250101;3. Network Center, Ludong University, Yantai 264025)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-04-20 Published:2010-04-20

摘要: 根据重复博弈中的讨价还价策略,提出一种网络演化算法,对网络特性进行分析,研究影响网络社团结构的因素。仿真实验结果表明,在不改变节点个数情况下,复杂网络仅进行边的演化。另外,网络的度分布服从幂律分布,其具有较高的聚集系数,且网络社团结构可以被优化。

关键词: 复杂网络, 讨价还价策略, 囚徒困境

Abstract: According to the Tit-for-Tat tactics in repeat game, a network evolving algorithm is presented. The network character is analyzed. The facts influencing the network community are researched. Simulation results show that, on the premise of unchanging the nodes number, the complex network only conducts edge evolvement. The degree distribution of network obeys power-law distribution and the clustering coefficient is high. The structure of network community can be optimaized.

Key words: complex network, Tit-for-Tat tactics, prisoner’s dilemma

中图分类号: