Talk, Judge, Cooperate: Gossip-Driven Indirect Reciprocity in Self-Interested LLM Agents

Shuhui Zhu, Yue Lin, Shriya Kaistha, Wenhao Li, Baoxiang Wang +3 more
2/8/2026
cs.MAcs.GT

Official code: shuhui-zhu/ALIGN (6 stars, last commit 2026-02-08).

Abstract

Indirect reciprocity, which means helping those who help others, is difficult to sustain among decentralized, self-interested LLM agents without reliable reputation systems. We introduce Agentic Linguistic Gossip Network (ALIGN), an automated framework where agents strategically share open-ended gossip using hierarchical tones to evaluate trustworthiness and coordinate social norms. We demonstrate that ALIGN consistently improves indirect reciprocity and resists malicious entrants by identifying and ostracizing defectors without changing intrinsic incentives. Notably, we find that stronger reasoning capabilities in LLMs lead to more incentive-aligned cooperation, whereas chat models often over-cooperate even when strategically suboptimal. These results suggest that leveraging LLM reasoning through decentralized gossip is a promising path for maintaining social welfare in agentic ecosystems. Our code is available at https://github.com/shuhui-zhu/ALIGN.

View on arXivView PDF

Code Implementations(1)

shuhui-zhu/ALIGNOfficial100%

Agentic Linguistic Gossip Network (ALIGN) is an adaptive framework where agents strategically share open-ended gossip using hierarchical tones to evaluate trustworthiness and coordinate social norms.

60PythonJan 30, 20268 months ago

Similar Papers

Cite this paper

@article{zhu2026talk,
  title  = {Talk, Judge, Cooperate: Gossip-Driven Indirect Reciprocity in Self-Interested LLM Agents},
  author = {Shuhui Zhu and Yue Lin and Shriya Kaistha and Wenhao Li and Baoxiang Wang and Hongyuan Zha and Gillian K. Hadfield and Pascal Poupart},
  year   = {2026},
  eprint = {2602.07777},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.07777v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.07777.svg)](https://codeofpaper.com/paper/2602.07777)

Discussion