Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (30): 67-70.

• 学术探讨 • Previous Articles     Next Articles

Using genetic algorithms for prisoner’s dilemma

DING Jing,WU Ping   

  1. Computer Center,East China Normal University,Shanghai 200062,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-21 Published:2007-10-21
  • Contact: DING Jing


丁 晶,吴 萍   

  1. 华东师范大学 计算中心,上海 200062
  • 通讯作者: 丁 晶

Abstract: The prisoner’s dilemma is a philosophy’s problem.This game may seem simple but it has generated a huge amount of research and has been used to analyze and explain a multitude of real world scenarios such as businesses interacting in a market,personal relationships,super power negotiations and trench warfare“live and let live” system of World War I.How to solve the problem? In this paper,applies genetic algorithms in the IPD to solve it.Based on the algorithms,takes a experiment,and the result reached the goals.

摘要: 囚犯困境问题是个哲学问题。随着对它研究的深入,这个问题已经作为一种模型被应用到现实社会的很多领域:经济学、社会学、商务谈判。这就提出了一个问题:如何有效地求解囚犯困境问题。利用遗传算法,对囚犯困境问题进行了求解。并且根据所提的算法进行了实验。证明该方法用于求解囚犯困境问题的可行性。