Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We study two of the simple rules on finite graphs under the death–birth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502–505]. Each rule specifies a payoff-ratio cutoff point for the magnitude of fixation probabilities of the underlying evolutionary game between cooperators and defectors. We view the Markov chains associated with the two updating mechanisms as voter model perturbations. Then we present a first-order approximation for fixation probabilities of general voter model perturbations on finite graphs subject to small perturbation in terms of the voter model fixation probabilities. In the context of regular graphs, we obtain algebraically explicit first-order approximations for the fixation probabilities of cooperators distributed as certain uniform distributions. These approximations lead to a rigorous proof that both of the rules of Ohtsuki et al. are valid and are sharp.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Five Rules for the Evolution of Cooperation
Nowak, M. A. (2006) · Science · doi:10.1126/science.1133755 · Cited by 5,894 · cited 1×
“For more b/c rules see [8, 16] and [20], to name but a few.”
BackgroundEvolutionary Games and Population Dynamics
Hofbauer, J., & Sigmund, K. (1998) · doi:10.1017/cbo9781139173179 · Cited by 5,502 · cited 1×
“See, for example, Chapter 7 in [10], Chapter 4 in [17] or Section 3 in [9] for this model and more details.”
BackgroundA simple rule for the evolution of cooperation on graphs and social networks
Ohtsuki, H., Hauert, C., Lieberman, E., & Nowak, M. A. (2006) · Nature · doi:10.1038/nature04605 · Cited by 2,208 · cited 13×
“(See also the references in [18] for other models on structured populations.”
BackgroundInfluentialSigmund, K. (2010) · doi:10.1515/9781400832255 · Cited by 570
Cited by
Evolutionary dynamics on any population structure
Allen, B., Lippner, G., Chen, Y.-T., Fotouhi, B., Momeni, N., Yau, S.-T., & Nowak, M. A. (2017) · Nature · doi:10.1038/nature21723 · Cited by 534
Self-citationEvolution of cooperation with asymmetric social interactions
Su, Q., Allen, B., & Plotkin, J. B. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2113468118 · Cited by 104
A mathematical formalism for natural selection with arbitrary spatial and genetic structure
Allen, B., & McAvoy, A. (2019) · Journal of Mathematical Biology · doi:10.1007/s00285-018-1305-z · Cited by 37
Evaluating the structure-coefficient theorem of evolutionary game theory
McAvoy, A., & Wakeley, J. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2119656119 · Cited by 23
“This trade-off between model complexity and tractability has prompted a variety of approaches ranging from approximation techniques [28, 29] to exact results on simplified population structures [30–33].”
Method
Metadata
- Authors
- Chen, Y.-T.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 2013-04-01
- Volume
- 23
- Issue
- 2
- Pages
- 637-664
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W2029605818
- Cited by
- 42
- References
- 4
- FWCI
- 8.24
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.