{"title":"游戏概况:迭代囚徒困境中无限长游戏对进化的影响","authors":"Lee-Ann Barlow, Jeffrey Tsang","doi":"10.1109/CIG.2015.7317950","DOIUrl":null,"url":null,"abstract":"It is well-known that the correct strategy in iterated Prisoner's Dilemma with a finite known number of rounds is to always defect. Evolution of Prisoner's Dilemma playing agents mirrors this: the more rounds the agents play against each other per encounter, the more likely the population will evolve to a cooperative state. Prior work has demonstrated that the result of evolution changes dramatically from very short games up to about 60-85 rounds, which yields substantially similar populations as those using 150 rounds. We extend this study using more powerful statistical tests and mathematical tools, including fingerprinting and play profiles, to consider the problem in the opposite direction: as the correct strategy in infinitely iterated Prisoner's Dilemma is to always cooperate, how many rounds are needed until evolution reflects this empirically? Within a very large plateau, from around 150 to a million rounds, evolution does not significantly change its behaviour. Surprisingly, behaviour does change again from millions to billions of rounds, but not further from billions to infinite-round games. This suggests that evolution operates on nontrivial categories of cooperativity depending on the number of rounds and the details of the representation.","PeriodicalId":244862,"journal":{"name":"2015 IEEE Conference on Computational Intelligence and Games (CIG)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Play profiles: The effect of infinite-length games on evolution in the iterated Prisoner's Dilemma\",\"authors\":\"Lee-Ann Barlow, Jeffrey Tsang\",\"doi\":\"10.1109/CIG.2015.7317950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well-known that the correct strategy in iterated Prisoner's Dilemma with a finite known number of rounds is to always defect. Evolution of Prisoner's Dilemma playing agents mirrors this: the more rounds the agents play against each other per encounter, the more likely the population will evolve to a cooperative state. Prior work has demonstrated that the result of evolution changes dramatically from very short games up to about 60-85 rounds, which yields substantially similar populations as those using 150 rounds. We extend this study using more powerful statistical tests and mathematical tools, including fingerprinting and play profiles, to consider the problem in the opposite direction: as the correct strategy in infinitely iterated Prisoner's Dilemma is to always cooperate, how many rounds are needed until evolution reflects this empirically? Within a very large plateau, from around 150 to a million rounds, evolution does not significantly change its behaviour. Surprisingly, behaviour does change again from millions to billions of rounds, but not further from billions to infinite-round games. This suggests that evolution operates on nontrivial categories of cooperativity depending on the number of rounds and the details of the representation.\",\"PeriodicalId\":244862,\"journal\":{\"name\":\"2015 IEEE Conference on Computational Intelligence and Games (CIG)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Conference on Computational Intelligence and Games (CIG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2015.7317950\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Conference on Computational Intelligence and Games (CIG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2015.7317950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Play profiles: The effect of infinite-length games on evolution in the iterated Prisoner's Dilemma
It is well-known that the correct strategy in iterated Prisoner's Dilemma with a finite known number of rounds is to always defect. Evolution of Prisoner's Dilemma playing agents mirrors this: the more rounds the agents play against each other per encounter, the more likely the population will evolve to a cooperative state. Prior work has demonstrated that the result of evolution changes dramatically from very short games up to about 60-85 rounds, which yields substantially similar populations as those using 150 rounds. We extend this study using more powerful statistical tests and mathematical tools, including fingerprinting and play profiles, to consider the problem in the opposite direction: as the correct strategy in infinitely iterated Prisoner's Dilemma is to always cooperate, how many rounds are needed until evolution reflects this empirically? Within a very large plateau, from around 150 to a million rounds, evolution does not significantly change its behaviour. Surprisingly, behaviour does change again from millions to billions of rounds, but not further from billions to infinite-round games. This suggests that evolution operates on nontrivial categories of cooperativity depending on the number of rounds and the details of the representation.