Sample Efficient Training in Multi-Agent Adversarial Games with Limited Teammate Communication
Not on the map. Why?
Abstract (arXiv)
We describe our solution approach for Pommerman TeamRadio, a competition environment associated with NeurIPS 2019. The defining feature of our algorithm is achieving sample efficiency within a restrictive computational budget while beating the previous years learning agents. The proposed algorithm (i) uses imitation learning to seed the policy, (ii) explicitly defines the communication protocol between the two teammates, (iii) shapes the reward to provide a richer feedback signal to each agent during training and (iv) uses masking for catastrophic bad actions. We describe extensive tests against baselines, including those from the 2019 competition leaderboard, and also a specific investigation of the learned policy and the effect of each modification on performance. We show that the proposed approach is able to achieve competitive performance within half a million games of training, significantly faster than other studies in the literature.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 1 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2023Mimicking To Dominate: Imitation Learning Strategies for Success in Multiagent Competitive Games
- 2022Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games
- 2020Follow the Neurally-Perturbed Leader for Adversarial Training ↗
- 2019Accelerating Training in Pommerman with Imitation and Reinforcement Learning
- 2025Enhancing Language Agent Strategic Reasoning through Self-Play in Adversarial Games
- 2024Toward Optimal LLM Alignments Using Two-Player Games
- 2018Sample-Efficient Imitation Learning via Generative Adversarial Nets
- 2018Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learning