ZHU Hai-yan1, WANG Li-hu2. Simulation of cooperation evolution based on genetic algorithm[J]. 2010, 29(11): 29-32. DOI: 10.13873/j.1000-97872010.11.024.
基于遗传算法的合作演化仿真
摘要
用Multi-Agent建模与仿真研究方法
构建小世界网络下的囚徒困境博弈演化模型
以遗传算法模拟重复博弈策略的演化
研究小世界网络下囚徒困境博弈的合作演化规律。仿真结果表明:重复博弈机制下合作更容易形成
重复博弈下的优秀策略具有一些共同的特征。
Abstract
Based on the research method of Multi-Agent modeling and simulation
a small world networks model of prisoner’s dilemma game is built up and evolution of strategies in iterated prisoner’s dilemma game is simulated using genetic algorithm
cooperation evolution law of prisoner’s dilemma game under small networks is studied.The simulation result indicates cooperation emerges easily due to iterated game mechanism
and excellent strategies have common characteristics under iterated prisoner’s dilemma game.
关键词
Keywords
references
遗传算法研究综述 [J]. 葛继科,邱玉辉,吴春明,蒲国林. 计算机应用研究 . 2008(10)
Evolution of coordinated alternating reciprocity in repeated dyadic games [J] . Lindsay Browning,Andrew M Colman. Journal of Theoretical Biology . 2004 (4)
Defectors’ niches: prisoner’s dilemma game on disordered networks [J] . Masaki Tomochi. Social Networks . 2004 (4)
Spatial prisoner’s dilemma optimally played in small-world networks [J] . Naoki Masuda,Kazuyuki Aihara. Physics Letters A . 2003 (1)
Spatial evolution of automata in the prisoners’ dilemma [J] . Oliver Kirchkamp. Journal of Economic Behavior and Organization . 2000 (2)
On Six Advances in Cooperation Theory [J] . Robert Axelrod. Analyse & Kritik . 2000 (1)