节点文献

复杂网络上的演化博弈

Stimulate Parameters Study of Small World Neural Network

【作者】 彭辉

【导师】 李延龙;

【作者基本信息】 兰州理工大学 , 凝聚态物理, 2012, 硕士

【摘要】 现实世界的复杂性系统可以用复杂网络来描述,博弈论在生物、经济等系统中有着广泛应用,因此复杂网络理论与博弈论的结合给出了一个研究复杂性系统的新思路。和传统的物理系统相比,复杂网络上的演化博弈给出了更为丰富的物理现象。本文通过蒙特卡罗数值模拟方法研究了两个双层网络上的囚徒困境演化博弈模型,其中底层的相互作用网络为二维格子网络,顶层的策略学习网络为二维Newman-Watts小世界网络。两层网络之间的差异程度可以用p来衡量,即参与者有机会模仿除有直接相互博弈关系外的其它博弈者(捷径邻居),而模仿捷径邻居的概率为p/(1+p)。值得注意的是,本文中顶层网络的选取与M.Ifti等和Wu等用到的学习网络有很大的不同。在他们的学习网络中,策略学习邻居随着获取信息能力的增大只能从最近邻开始依次增大到次近邻、次次近邻等。而在本文的Newman-Watts小世界网络网络中,捷径邻居可以是除最近邻外整个网络中任意一个可能的参与者,从这个角度来看本文的博弈者收集信息的能力要“强于”M.Ifti等和Wu等用到的网络,但是当p=1时,整个网络的捷径邻居数才和原相互作用邻居数相等,从这个角度说本文中的网络获得的信息量要“远少于”M.Ifti等和Wu等用到的网络。模型Ⅰ为双层网络上的两策略的囚徒困境博弈模型。通过研究表明当模仿捷径邻居的概率提升到10%以上就能有效的提高合作态密度,即捷径邻居的存在有利于合作现象维持。模型Ⅱ为双层网络上的有志愿者参加的囚徒困境博弈模型。研究表明不存在捷径邻居时,且对较弱的背叛诱惑,随着噪声水平的变化合作态密度出现多个峰值,而较大的背叛诱惑值下只有一个极大值。当存在捷径邻居时,原来的多峰相干共振现象被单峰的共振现象代替,对于较大的背叛诱惑,当p足够大时,随着噪声水平的变化合作态密度会出现两个极大值。在足够大的背叛诱惑下,增大p使得各种策略密度发生剧烈的震荡直到进入只存在单一策略态的“僵态”。

【Abstract】 We can describe complex systems of the real world by complex networks, game theoryapplied widely in the biological, economic and other systems. Thereby, the incorporation ofcomplex networks and game theory will give a new idea for researching complex systems.Evolutionary games on graphs presents more abundant physical phenomena compare with thetraditional physical systems.In this paper, we study two models of evolutionary prisoner’s dilemma games on the two-layers networks by the Monte Carol numerical simulation method, where the lowerinteraction layer is a square lattice with Von Neumann neighborhood, the upper learning layeris the two-dimensional Newman-Watts small-world networks. The difference between thetwo layers of network can be measured the by the probability p of the Newman-Watts small-world networks, i.e. players have the chance to imitate one except interaction neighborhoods(shortcut neighbors), and the probability is p/(1+p). It is worth noting that our upper learninglayer is very different with one’s of M. Ifti etc or Wu etc. In their networks, increasing ofgetting information ability, the each player can learn form their nearest neighbors, nearest andnext-nearest neighbors, and so on. In the Newman-Watts small-world networks, shortcutneighbors can be anyone of the whole nodes except interaction neighborhoods, from this pointof view to consider, the ability of getting information in our network is stronger than one’s byM. Ifti etc or Wu etc. But when p=1the numbers of shortcut neighbors are equal to interactionneighborhoods, from this point of view to consider, the quantity of getting information in ournetwork is far less than one’s by M. Ifti etc or Wu etc.The modelⅠis the evolutionary prisoner’s dilemma games on the two-layers networks.The research shows that it can effectively improve the cooperation when the probability ofimitating shortcut neighbors increasing above10%. The modelⅡ is the evolutionaryprisoner’s dilemma games with volunteering on the two-layers networks. The research showsthat the cooperation density have multi-pecks vs. the noise level on the smaller temptationvalue b, but one-pesky on the larger b when shortcut neighbors are absence, but the originalmulti-pecks are instead of one-pesk on the smaller b, on the larger b, it have two-pecks and all strategies density will sharply fluctuating until only one strategy to exist with increasing of pwhen shortcut neighbors are present.

  • 【分类号】O157.5;O225
  • 【被引频次】1
  • 【下载频次】258
  • 攻读期成果
节点文献中: 

本文链接的文献网络图示:

本文的引文网络