Reward-Independent Messaging for Decentralized Multi-Agent Reinforcement Learning

Naoto Yoshida, Tadahiro Taniguchi
5/28/2025
cs.MAcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

In multi-agent reinforcement learning (MARL), effective communication improves agent performance, particularly under partial observability. We propose MARL-CPC, a framework that enables communication among fully decentralized, independent agents without parameter sharing. MARL-CPC incorporates a message learning model based on collective predictive coding (CPC) from emergent communication research. Unlike conventional methods that treat messages as part of the action space and assume cooperation, MARL-CPC links messages to state inference, supporting communication in non-cooperative, reward-independent settings. We introduce two algorithms -Bandit-CPC and IPPO-CPC- and evaluate them in non-cooperative MARL tasks. Benchmarks show that both outperform standard message-as-action approaches, establishing effective communication even when messages offer no direct benefit to the sender. These results highlight MARL-CPC's potential for enabling coordination in complex, decentralized environments.

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. Any repos shown below are weak matches — 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{yoshida2025rewardindependent,
  title  = {Reward-Independent Messaging for Decentralized Multi-Agent Reinforcement Learning},
  author = {Naoto Yoshida and Tadahiro Taniguchi},
  year   = {2025},
  eprint = {2505.21985},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.21985v1}
}

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

Discussion