Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 190

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

The Algebra of Assortative Encounters and the Evolution of Cooperation

Bergstrom, Theodore C.·2003·International Game Theory Review

Abstract

This paper explores the way in which assortative matching can maintain cooperative behavior under evolutionary dynamics. If encounters are random, then in Prisoner's Dilemma games, defectors necessarily get higher payoffs than cooperators and thus will eventually prevail. But if matching is assortative, the cost of cooperating may be repaid by higher probabilities of playing against a cooperating opponent. This paper shows that a simple index of assortativity allows a unifying treatment of the evolutionary dynamics in a wide variety of models of social encounters.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/s0219198903001021

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 190

Metadata

Authors
Bergstrom, T. C.
Venue
International Game Theory Review
Published
2003-09
Volume
05
Issue
03
Pages
211-228
ISSN
  • 0219-1989 (ISSN-L)
  • 1793-6675
OpenAlex
W2138750606
Cited by
190
References
1
FWCI
17.99
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The Algebra of Assortative Encounters and the Evolution of Cooperation. https://app.cochat.ai/papers/10.1142/s0219198903001021
The paper
Bergstrom, T. C. (2003). The Algebra of Assortative Encounters and the Evolution of Cooperation. International Game Theory Review. https://doi.org/10.1142/s0219198903001021

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.