Indirect Reciprocity Enhances Collective Cooperation on Weighted Networks

Direct, indirect, and network reciprocities are established mechanisms that sustain cooperation in natural and artificial systems. Yet which mechanism most effectively promotes cooperation on a given network remains unclear. Here, we develop a game-theoretic model to explore the evolution of direct and indirect reciprocity on weighted networks. Unlike classical donor-recipient frameworks, we study symmetric repeated interactions on undirected weighted networks with bilateral reputation updates, capturing heterogeneous tie strengths and accelerating reputation spread. We derive a general condition for reciprocal cooperation that unifies unweighted and weighted cases. Across large ensembles of random and empirical networks, indirect reciprocity consistently enhances cooperation, whereas stronger interactions sharply lower the benefit-to-cost threshold under direct reciprocity. To test the robustness of these insights, we examine competition among six reciprocity strategies and find that indirect reciprocity dominates. Our findings demonstrate that choosing the right reciprocity can promote global cooperation on social networks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cybernetics
Published
2025-10-23
DOI
https://doi.org/10.1109/tcyb.2025.3617531
Primary Topic
Opinion Dynamics and Social Influence
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Indirect Reciprocity Enhances Collective Cooperation on Weighted Networks

Hui Wei, Ming Cao, Jianlei Zhang, Chunyan Zhang
IEEE Transactions on Cybernetics
Opinion Dynamics and Social Influence
article

Indirect Reciprocity Enhances Collective Cooperation on Weighted Networks

Hui Wei, Ming Cao, Jianlei Zhang, Chunyan Zhang
article en

Abstract

Direct, indirect, and network reciprocities are established mechanisms that sustain cooperation in natural and artificial systems. Yet which mechanism most effectively promotes cooperation on a given network remains unclear. Here, we develop a game-theoretic model to explore the evolution of direct and indirect reciprocity on weighted networks. Unlike classical donor-recipient frameworks, we study symmetric repeated interactions on undirected weighted networks with bilateral reputation updates, capturing heterogeneous tie strengths and accelerating reputation spread. We derive a general condition for reciprocal cooperation that unifies unweighted and weighted cases. Across large ensembles of random and empirical networks, indirect reciprocity consistently enhances cooperation, whereas stronger interactions sharply lower the benefit-to-cost threshold under direct reciprocity. To test the robustness of these insights, we examine competition among six reciprocity strategies and find that indirect reciprocity dominates. Our findings demonstrate that choosing the right reciprocity can promote global cooperation on social networks.

IEEE Transactions on CyberneticsVol. 56(2)
University of Groningen (NL), Peking University (CN), Nankai University (CN), Robotics Research (United States) (US)
Openalex Percentile: Top 76%
Opinion Dynamics and Social Influence
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.

Indirect Reciprocity Enhances Collective Cooperation on Weighted Networks — Hui Wei, Ming Cao, et al. · IEEE Transactions on Cybernetics (2025) | TGRS Research Map | TGRS