复活、复现与重访阿克塞尔罗德第二次锦标赛
Reviving, reproducing, and revisiting Axelrod's second tournament
AI总结:
本研究通过恢复原始Fortran代码并构建Python接口,复现了阿克塞尔罗德第二次IPD锦标赛,确认TFT策略的主导地位,并评估了原始策略的稳健性,为历史结果提供了当代验证与重新评估。
摘要:
直接互惠,通常通过迭代囚徒困境(IPD)进行研究,对于理解合作如何演化至关重要。在20世纪80年代,罗伯特·阿克塞尔罗德组织了两次有影响力的IPD计算机锦标赛,其中“以牙还牙”(TFT)策略脱颖而出成为冠军。然而,档案记录并不完整:对于第一次锦标赛,仅存有一份报告;对于第二次锦标赛,提交的Fortran策略代码仍然存在,但最终的锦标赛代码却缺失了。这一空白引发了对这些具有历史影响力的结果的可复现性的疑问。我们通过将幸存的Fortran实现恢复至可用现代编译器编译,并构建一个无需修改即可调用原始策略函数的Python接口,从而重现了第二次锦标赛。利用开源的Axelrod-Python库运行锦标赛,我们复现了阿克塞尔罗德的主要发现:TFT占据优势,且成功的策略往往倾向于合作、对背叛作出响应,并愿意宽恕。策略排名基本保持不变。随后,我们通过纳入额外策略来评估原始提交策略的稳健性,并运行了迄今为止规模最大的IPD锦标赛之一。我们发现,原始锦标赛对TFT特别有利,并且当原始提交策略构成参赛者的大多数时,很难将TFT从冠军宝座上拉下。我们还观察到,在更多样化的环境和噪声条件下,几个不太知名的提交策略表现强劲。我们的贡献包括:(i)首次系统性地复现阿克塞尔罗德第二次锦标赛;(ii)根据新策略和新环境对原始结果进行当代重新评估;(iii)在Axelrod-Python中保留了一个易于使用的第二次锦标赛策略实现,以支持未来的研究。
英文摘要:
Direct reciprocity, typically studied using the Iterated Prisoner's Dilemma (IPD), is central to understanding how cooperation evolves. In the 1980s, Robert Axelrod organized two influential IPD computer tournaments, where Tit for Tat (TFT) emerged as the winner. Yet the archival record is incomplete: for the first tournament only a report survives, and for the second the submitted Fortran strategies remain but not the final tournament code. This gap raises questions about the reproducibility of these historically influential results. We recreate the second tournament by restoring the surviving Fortran implementations to compile with modern compilers and by building a Python interface that calls the original strategy functions without modification. Using the open-source Axelrod-Python library to run tournaments, we reproduce Axelrod's main findings: TFT prevails, and successful play tends to be cooperative, responsive to defection, and willing to forgive. Strategy rankings remain mostly unchanged. We then assess the robustness of the originally submitted strategies by incorporating additional strategies, and we run one of the largest IPD tournaments to date. We find that the original tournament was especially favorable to TFT and that it is difficult to dethrone TFT when the original submissions make up the majority of the field. We also observe that several lesser-known submissions perform strongly in more diverse settings and under noise. Our contributions are: (i) the first systematic reproduction of Axelrod's second tournament; (ii) a contemporary reassessment of the original results in light of new strategies and settings; and (iii) a preserved, easy-to-use implementation of the second-tournament strategies within Axelrod-Python to support future research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。