arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.15531q-bio.PE
收藏

两个博弈之间的自然选择与图上的复制者动力学

Natural Selection between Two Games and Replicator Dynamics on Graphs

Georgiy Karev

AI总结:

本文研究了图上两个博弈之间的自然选择问题,应用参数化博弈方法比较了完全图上的标准博弈与更新规则博弈,并展示了其参数分布演化,该方法可推广至局部复制者动力学、二倍体基因组及癌症建模等问题。

摘要:

在本文中,我研究了两个博弈之间的自然选择,以确定哪个博弈将因自然选择而在群落中占主导地位。以参数化博弈形式对该问题进行的公式化以及解决该问题的数学工具箱近期已在 (Karev 2024) 中被开发出来。在此,我将所开发的方法应用于图上博弈之间的自然选择。具体而言,我将完全图上的标准博弈与具有 Ohtsuki 和 Nowak (2006) 所建议的更新规则的博弈进行了比较。初始博弈与更新后博弈之间,或不同更新后博弈之间的自然选择结果,通过相应参数化博弈中参数分布的演化进行了可视化。所开发的方法可用于其他问题,例如局部复制者动力学、两两竞争、二倍体基因组中等位基因的博弈(见 Karev 2004)以及癌症建模 (Kareva, Karev 2019)。

英文摘要:

In this paper I study the natural selection between two games to determine, which game will dominate in the community as a result of natural selection. The formalization of this question in the form of a parametrized game and the mathematical toolbox to solve it were recently developed in (Karev 2024). Here, I applied the developed approach to natural selection between games on graphs. Specifically, I compare standard games on a complete graph with games that have updated rules suggested by Ohtsuki and Nowak (2006). The results of the natural selection between the initial and updated games, or between different updated games were visualized through the evolution of the parameter distribution in corresponding parametrized game. The developed approach can be used for other problems, such as local replicator dynamics, pairwise competition, the game of alleles in diploid genomes (see Karev 2004) and cancer modeling (Kareva, Karev 2019).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑