Aspiration-based full cooperation in finite systems of players
Aspiration-based full cooperation in finite systems of players
复制标题
DOI：
10.1016/j.amc.2014.11.054
复制
发表时间：
2015-01
期刊：
影响因子：
--
通讯作者：
T. Platkowski
中科院分区：
文献类型：
--
作者：
T. Platkowski
我们提出了一个数学模型的演化有限的混合人口的球员谁改变他们的行为，如果从囚徒困境的互动获得的回报小于阈值（愿望水平）。阈值可以是固定常数或动态变量，其取决于系统的某些总体动态变化特性。我们调查的依赖，充分合作的群体规模，游戏收益，愿望水平，和异质性的系统。对于内生的愿望，我们发现分析条件，保证充分的合作，从长远来看，所有的初始配置和组的大小。结果是强大的随机选择的策略，由异构的球员，记录的数值模拟。
We propose a mathematical model of evolution of a finite well-mixed population of players who change their behavior if the payoff obtained from Prisoner’s Dilemma based interactions is smaller than a threshold (aspiration level). The threshold can be a fixed constant or a dynamical variable, which depends on some overall dynamically changing characteristics of the system. We investigate the dependence of full cooperation on the group size, game payoffs, aspiration level, and heterogeneity of the system. For endogenous aspirations we find analytically conditions which guarantee full cooperation in the long run for all initial configurations and group sizes. The result is robust to a stochastic choice of strategies by the heterogeneous players, as documented by numerical simulations.