首页    期刊浏览 2025年02月17日 星期一
登录注册

文章基本信息

  • 标题:Evolutionary Tournament-Based Comparison of Learning and Non-Learning Algorithms for Iterated Games
  • 本地全文:下载
  • 作者:Stéphane Airiau ; Sabyasachi Saha ; Sandip Sen
  • 期刊名称:Journal of Artificial Societies and Social Simulation
  • 印刷版ISSN:1460-7425
  • 出版年度:2007
  • 卷号:10
  • 期号:3
  • 页码:1-12
  • 出版社:University of Surrey, Department of Sociology
  • 摘要:Evolutionary tournaments have been used effectively as a tool for comparing game-playing algorithms. For instance, in the late 1970's, Axelrod organized tournaments to compare algorithms for playing the iterated prisoner's dilemma (PD) game. These tournaments capture the dynamics in a population of agents that periodically adopt relatively successful algorithms in the environment. While these tournaments have provided us with a better understanding of the relative merits of algorithms for iterated PD, our understanding is less clear about algorithms for playing iterated versions of arbitrary single-stage games in an environment of heterogeneous agents. While the Nash equilibrium solution concept has been used to recommend using Nash equilibrium strategies for rational players playing general-sum games, learning algorithms like fictitious play may be preferred for playing against sub-rational players. In this paper, we study the relative performance of learning and non-learning algorithms in an evolutionary tournament where agents periodically adopt relatively successful algorithms in the population. The tournament is played over a testbed composed of all possible structurally distinct 2×2 conflicted games with ordinal payoffs: a baseline, neutral testbed for comparing algorithms. Before analyzing results from the evolutionary tournament, we discuss the testbed, our choice of representative learning and non-learning algorithms and relative rankings of these algorithms in a round-robin competition. The results from the tournament highlight the advantage of learning algorithms over players using static equilibrium strategies for repeated plays of arbitrary single-stage games. The results are likely to be of more benefit compared to work on static analysis of equilibrium strategies for choosing decision procedures for open, adapting agent society consisting of a variety of competitors.
  • 关键词:Repeated Games; Evolution; Simulation
国家哲学社会科学文献中心版权所有