...
首页> 外文期刊>Scientific reports. >Multi-AI competing and winning against humans in iterated Rock-Paper-Scissors game
【24h】

Multi-AI competing and winning against humans in iterated Rock-Paper-Scissors game

机译:在迭代摇滚剪刀游戏中竞争和赢得人类的多AI竞争和获胜

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Predicting and modeling human behavior and finding trends within human decision-making processes is a major problem of social science. Rock Paper Scissors (RPS) is the fundamental strategic question in many game theory problems and real-world competitions. Finding the right approach to beat a particular human opponent is challenging. Here we use an AI (artificial intelligence) algorithm based on Markov Models of one fixed memory length (abbreviated as “single AI”) to compete against humans in an iterated RPS game. We model and predict human competition behavior by combining many Markov Models with different fixed memory lengths (abbreviated as “multi-AI”), and develop an architecture of multi-AI with changeable parameters to adapt to different competition strategies. We introduce a parameter called “focus length” (a positive number such as 5 or 10) to control the speed and sensitivity for our multi-AI to adapt to the opponent’s strategy change. The focus length is the number of previous rounds that the multi-AI should look at when determining which Single-AI has the best performance and should choose to play for the next game. We experimented with 52 different people, each playing 300 rounds continuously against one specific multi-AI model, and demonstrated that our strategy could win against more than 95% of human opponents.
机译:预测和建模人类行为和发现人类决策过程中的趋势是社会科学的一个主要问题。摇滚纸剪刀(RPS)是许多博弈论问题和现实世界比赛中的基本战略问题。找到击败特定人类对手的正确方法是挑战。在这里,我们使用基于一个固定存储器长度的Markov模型的AI(人工智能)算法(缩写为“单个AI”)来竞争迭代RPS游戏中的人类。通过将许多Markov模型与不同的固定内存长度组合(缩写为“Multi-AI”)来模拟和预测人类竞争行为,并开发具有可变参数的多AI架构,以适应不同的竞争策略。我们介绍一个名为“焦距”(如5或10)的参数,以控制我们多AI的速度和灵敏度,以适应对手的策略变化。焦距是在确定哪个单一的单一具有最佳性能时,多AI应该查看的前一轮的数量,并且应该选择为下一个游戏播放。我们尝试了52种不同的人,每个不同的人持续300轮,针对一个特定的多AI模型,并证明了我们的策略可以赢得超过95%的人类对手。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号