Exploration enhances cooperation in the multi-agent communication system

Zhao Song, Chen Shen, Zhen Wang, The Anh Han
3/2/2026
cs.MAcs.GT

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Designing protocols enhancing cooperation for multi-agent systems remains a grand challenge. Cheap talk, defined as costless, non-binding communication before formal action, serves as a pivotal solution. However, existing theoretical frameworks often exclude random exploration, or noise, for analytical tractability, leaving its functional impact on system performance largely unexplored. To bridge this gap, we propose a two-stage evolutionary game-theoretical model, integrating signalling with a donation game, with exploration explicitly incorporated into the decision-making. Our agent-based simulations across topologies reveal a universal optimal exploration rate that maximises system-wide cooperation. Mechanistically, moderate exploration undermines the stability of defection and catalyses the self-organised cooperative alliances, facilitating their cyclic success. Moreover, the cooperation peak is enabled by the delicate balance between oscillation period and amplification. Our findings suggest that rather than pursuing deterministic rigidity, embracing strategic exploration, as a form of engineered randomness, is essential to sustain cooperation and realise optimal performance in communication-based intelligent systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{song2026exploration,
  title  = {Exploration enhances cooperation in the multi-agent communication system},
  author = {Zhao Song and Chen Shen and Zhen Wang and The Anh Han},
  year   = {2026},
  eprint = {2603.01401},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.01401v1}
}

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/2603.01401.svg)](https://codeofpaper.com/paper/2603.01401)

Discussion