{"title":"Alternative evolution of strategies with memory","authors":"","doi":"10.26565/2304-6201-2019-44-08","DOIUrl":null,"url":null,"abstract":"Within the generalized prisoner's dilemma, the evolution of a population with a complete set of behavioral strategies limited only by memory depth has been examined. Evolution considers the pairing of strategies, in accordance with the iterated prisoner's dilemma. In doing so, each strategy interacts with each, including itself. Each subsequent generation of the population consistently loses the most profitable behavior strategies of the previous generation. Increasing population memory has been shown to be evolutionarily beneficial. The winners of evolutionary selection consistently are the agents with maximum memory. The concept of strategy complexity has been introduced. Collective variables are introduced to obtain the average of the family of strategies and their changes over time are studied. Strategies that succeed in natural selection have been shown to have maximum or near maximum complexity. An alternative evolution of a family of strategies limited only by memory depth is considered. In each generation, a strategy that maximizes the point of evolutionary benefits is removed from the family. Such an alternative evolution leads to significant changes in the family compared to the normal evolution. In some ways, alternative evolution maintains maximum memory depth and complexity even more than normal evolution. The main difference is the stationary strategies being absolute aggressive against each other. The stationary family is formed by the strategies being the most aggressive towards each other. Memory depth and complexity of strategies, as in normal evolution, are evolutionarily beneficial properties. The universal relation between the aggressiveness of the population and the number of points of evolutionary advantages that the strategy receives on average per turn is considered. On the whole, the universal link between average aggression and the number of strategy payoffs per turn is maintained.","PeriodicalId":33695,"journal":{"name":"Visnik Kharkivs''kogo natsional''nogo universitetu imeni VN Karazina Seriia Matematichne modeliuvannia informatsiini tekhnologiyi avtomatizovani sistemi upravlinnia","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visnik Kharkivs''kogo natsional''nogo universitetu imeni VN Karazina Seriia Matematichne modeliuvannia informatsiini tekhnologiyi avtomatizovani sistemi upravlinnia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26565/2304-6201-2019-44-08","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Within the generalized prisoner's dilemma, the evolution of a population with a complete set of behavioral strategies limited only by memory depth has been examined. Evolution considers the pairing of strategies, in accordance with the iterated prisoner's dilemma. In doing so, each strategy interacts with each, including itself. Each subsequent generation of the population consistently loses the most profitable behavior strategies of the previous generation. Increasing population memory has been shown to be evolutionarily beneficial. The winners of evolutionary selection consistently are the agents with maximum memory. The concept of strategy complexity has been introduced. Collective variables are introduced to obtain the average of the family of strategies and their changes over time are studied. Strategies that succeed in natural selection have been shown to have maximum or near maximum complexity. An alternative evolution of a family of strategies limited only by memory depth is considered. In each generation, a strategy that maximizes the point of evolutionary benefits is removed from the family. Such an alternative evolution leads to significant changes in the family compared to the normal evolution. In some ways, alternative evolution maintains maximum memory depth and complexity even more than normal evolution. The main difference is the stationary strategies being absolute aggressive against each other. The stationary family is formed by the strategies being the most aggressive towards each other. Memory depth and complexity of strategies, as in normal evolution, are evolutionarily beneficial properties. The universal relation between the aggressiveness of the population and the number of points of evolutionary advantages that the strategy receives on average per turn is considered. On the whole, the universal link between average aggression and the number of strategy payoffs per turn is maintained.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
策略与记忆的选择性演化
在广义囚徒困境中,研究了具有一整套仅受记忆深度限制的行为策略的群体的进化。根据迭代囚徒困境,进化考虑策略配对。在此过程中,每种策略相互作用,包括其自身。种群的每一代后代都不断地失去上一代最有利可图的行为策略。增强种群记忆已被证明在进化上是有益的。进化选择的赢家始终是拥有最大记忆的个体。引入了策略复杂性的概念。引入集体变量来获得策略族的平均值,并研究它们随时间的变化。在自然选择中取得成功的策略具有最大或接近最大的复杂性。考虑了仅受记忆深度限制的一系列策略的替代进化。在每一代中,使进化利益最大化的策略都被从家族中移除。与正常进化相比,这种替代进化会导致家庭发生重大变化。在某些方面,替代进化比正常进化更能保持最大的记忆深度和复杂性。主要的区别在于固定策略彼此之间是绝对侵略性的。静止的家族是由彼此之间最具侵略性的策略组成的。记忆深度和策略的复杂性,在正常进化中,是进化上有益的特性。考虑了群体的攻击性与策略平均每回合获得的进化优势点数之间的普遍关系。总体而言,平均攻击性与每回合策略收益之间的普遍联系得以维持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
8 weeks
期刊最新文献
Ontological model for evaluating the effectiveness of scientific institutions Investigation of the chaotic dynamics of the vertical strance of a human body on the model of an inverted pendulum The mathematical model of the thermal process in Spoke-Type Permanent Magnet Synchronous Machines Statistical analysis of coronary blood flow monitoring data for hemodynamic assessment of the degree of coronary artery stenosis Flow modelling in a straight hard-walled duct with two rectangular axisymmetric narrowings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1