Strength asymmetry and replacement bias shape the evolution of cooperation in finite populations

Heterogeneity is common in real populations, but many classic evolutionary game models assume identical individuals. Here, we study how two simple forms of heterogeneity affect the evolution of cooperation in a finite population. We construct a model of evolution in a finite population with two heterogeneous subpopulations, referred to as weak and strong subpopulations. The heterogeneity is reflected in two aspects: strength asymmetry-the probability that a weak individual defeats a strong one, and replacement bias, which renders one subpopulation more likely to be updated than the other. Under weak selection, we employ the expected fixation probability framework to derive an explicit threshold for the benefit-cost ratio that determines when cooperation is favoured. We find three main results. First, when replacement is symmetric, increasing the proportion of weak individuals can enhance cooperation, with the strongest effect at an intermediate size imbalance. Second, when only replacement bias varies, the cooperation threshold increases with the bias, but the reason differs on either side of the symmetric point. Finally, when strong individuals are more likely to be updated, there is a clear 'sweet spot', where stronger strength asymmetry and stronger replacement bias jointly and monotonically promote cooperation.

Authors

Institutions

Publication Details

Journal
Journal of The Royal Society Interface
Published
2026-06-17
DOI
https://doi.org/10.1098/rsif.2026.0074
Primary Topic
Evolutionary Game Theory and Cooperation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strength asymmetry and replacement bias shape the evolution of cooperation in finite populations

Haomin Wang, Sha Song, Zhenyu Shi
Journal of The Royal Society Interface
Evolutionary Game Theory and Cooperation
article

Strength asymmetry and replacement bias shape the evolution of cooperation in finite populations

Haomin Wang, Sha Song, Zhenyu Shi
article en

Abstract

Heterogeneity is common in real populations, but many classic evolutionary game models assume identical individuals. Here, we study how two simple forms of heterogeneity affect the evolution of cooperation in a finite population. We construct a model of evolution in a finite population with two heterogeneous subpopulations, referred to as weak and strong subpopulations. The heterogeneity is reflected in two aspects: strength asymmetry-the probability that a weak individual defeats a strong one, and replacement bias, which renders one subpopulation more likely to be updated than the other. Under weak selection, we employ the expected fixation probability framework to derive an explicit threshold for the benefit-cost ratio that determines when cooperation is favoured. We find three main results. First, when replacement is symmetric, increasing the proportion of weak individuals can enhance cooperation, with the strongest effect at an intermediate size imbalance. Second, when only replacement bias varies, the cooperation threshold increases with the bias, but the reason differs on either side of the symmetric point. Finally, when strong individuals are more likely to be updated, there is a clear 'sweet spot', where stronger strength asymmetry and stronger replacement bias jointly and monotonically promote cooperation.

Journal of The Royal Society InterfaceVol. 23(239)
Shanghai Jiao Tong University (CN), ShanghaiTech University (CN), Beihang University (CN)
Partnerships for the goals
Openalex Percentile: Top 5%
Evolutionary Game Theory and Cooperation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.