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

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

Punish, but not too hard: how costly punishment spreads in the spatial public goods game

Open access
Helbing, Dirk, Szolnoki, Attila, Perc, Matjaž, Szabó, György·2010·New Journal of Physics

Abstract

We study the evolution of cooperation in spatial public goods games where, besides the classical strategies of cooperation (C) and defection (D), we consider punishing cooperators (PC) or punishing defectors (PD) as an additional strategy. Using a minimalist modeling approach, our goal is to separately clarify and identify the consequences of the two punishing strategies. Since punishment is costly, punishing strategies lose the evolutionary competition in case of well-mixed interactions. When spatial interactions are taken into account, however, the outcome can be strikingly different, and cooperation may spread. The underlying mechanism depends on the character of the punishment strategy. In the case of cooperating punishers, increasing the fine results in a rising cooperation level. In contrast, in the presence of the PD strategy, the phase diagram exhibits a reentrant transition as the fine is increased. Accordingly, the level of cooperation shows a non-monotonous dependence on the fine. Remarkably, punishing strategies can spread in both cases, but based on largely different mechanisms, which depend on the cooperativeness (or not) of punishers.

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.1088/1367-2630/12/8/083005

Cites

44 of 44 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 44 references

Cited by

See all 417

Metadata

Authors
Helbing, D., Szolnoki, A., Perc, M., & Szabó, G.
Venue
New Journal of Physics
Published
2010-08-03
Volume
12
Issue
8
Pages
083005
ISSN
1367-2630 (ISSN-L)
OpenAlex
W2113962824
Cited by
417
References
44
FWCI
61.56
Type
journal article
Language
en
Open access
gold

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: Punish, but not too hard: how costly punishment spreads in the spatial public goods game. https://app.cochat.ai/papers/10.1088/1367-2630/12/8/083005
The paper
Helbing, D., Szolnoki, A., Perc, M., & Szabó, G. (2010). Punish, but not too hard: how costly punishment spreads in the spatial public goods game. New Journal of Physics. https://doi.org/10.1088/1367-2630/12/8/083005

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.