Learning to Communicate Using Counterfactual Reasoning
Not on the map. Why?
Abstract (arXiv)
Learning to communicate in order to share state information is an active problem in the area of multi-agent reinforcement learning (MARL). The credit assignment problem, the non-stationarity of the communication environment and the creation of influenceable agents are major challenges within this research field which need to be overcome in order to learn a valid communication protocol. This paper introduces the novel multi-agent counterfactual communication learning (MACC) method which adapts counterfactual reasoning in order to overcome the credit assignment problem for communicating agents. Secondly, the non-stationarity of the communication environment while learning the communication Q-function is overcome by creating the communication Q-function using the action policy of the other agents and the Q-function of the action environment. Additionally, a social loss function is introduced in order to create influenceable agents which is required to learn a valid communication protocol. Our experiments show that MACC is able to outperform the state-of-the-art baselines in four different scenarios in the Particle environment.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
9 papers.
- 2021Learning to Simulate Self-Driven Particles System with Coordinated Policy Optimizationcited by 33
- 2021Causal Multi-Agent Reinforcement Learning: Review and Open Problemscited by 16
- 2022An Analysis of Discretization Methods for Communication Learning with Multi-Agent Reinforcement Learningcited by 6
- 2021Mixed Cooperative-Competitive Communication Using Multi-Agent Reinforcement Learningcited by 0
- 2021Learning to Communicate with Reinforcement Learning for an Adaptive Traffic Control Systemcited by 0
- 2022Classifying Ambiguous Identities in Hidden-Role Stochastic Games with Multi-Agent Reinforcement Learningcited by 0
- 2023Scalability of Message Encoding Techniques for Continuous Communication Learned with Multi-Agent Reinforcement Learningcited by 0
- 2023An In-Depth Analysis of Discretization Methods for Communication Learning using Backpropagation with Multi-Agent Reinforcement Learningcited by 0
- 2026Counterfactual Rollout Replay: Forkable Environments as Free Process Rewards for Software Engineering Agentscited by 0
- 2026Counterfactual Rollout Replay: Forkable Environments as Free Process Rewards for Software Engineering Agents27 Sep 2026
- 2023An In-Depth Analysis of Discretization Methods for Communication Learning using Backpropagation with Multi-Agent Reinforcement Learning9 Aug 2023
- 2023Scalability of Message Encoding Techniques for Continuous Communication Learned with Multi-Agent Reinforcement Learning9 Aug 2023
- 2022Classifying Ambiguous Identities in Hidden-Role Stochastic Games with Multi-Agent Reinforcement Learning24 Oct 2022
- 2022An Analysis of Discretization Methods for Communication Learning with Multi-Agent Reinforcement Learning12 Apr 2022
- 2021Causal Multi-Agent Reinforcement Learning: Review and Open Problems12 Nov 2021
- 2021Learning to Communicate with Reinforcement Learning for an Adaptive Traffic Control System29 Oct 2021
- 2021Mixed Cooperative-Competitive Communication Using Multi-Agent Reinforcement Learning29 Oct 2021
- 2021Learning to Simulate Self-Driven Particles System with Coordinated Policy Optimization26 Oct 2021