# Iterative Update and Unified Representation for Multi-Agent   Reinforcement Learning

**Authors:** Jiancheng Long, Hongming Zhang, Tianyang Yu, Bo Xu

arXiv: 1908.06758 · 2019-08-20

## TL;DR

This paper introduces a novel iterative update method and unified network representation for multi-agent reinforcement learning, significantly improving stability, efficiency, and scalability in environments with many agents.

## Contribution

It proposes an iterative update technique inspired by GANs and a unified network approach to address nonstationarity and memory issues in MARL.

## Key findings

- Achieves state-of-the-art performance compared to MADDPG.
- Reduces memory usage from linear growth to constant.
- Speeds up interaction with the environment, especially with many agents.

## Abstract

Multi-agent systems have a wide range of applications in cooperative and competitive tasks. As the number of agents increases, nonstationarity gets more serious in multi-agent reinforcement learning (MARL), which brings great difficulties to the learning process. Besides, current mainstream algorithms configure each agent an independent network,so that the memory usage increases linearly with the number of agents which greatly slows down the interaction with the environment. Inspired by Generative Adversarial Networks (GAN), this paper proposes an iterative update method (IU) to stabilize the nonstationary environment. Further, we add first-person perspective and represent all agents by only one network which can change agents' policies from sequential compute to batch compute. Similar to continual lifelong learning, we realize the iterative update method in this unified representative network (IUUR). In this method, iterative update can greatly alleviate the nonstationarity of the environment, unified representation can speed up the interaction with environment and avoid the linear growth of memory usage. Besides, this method does not bother decentralized execution and distributed deployment. Experiments show that compared with MADDPG, our algorithm achieves state-of-the-art performance and saves wall-clock time by a large margin especially with more agents.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1908.06758/full.md

## Figures

23 figures with captions in the complete paper: https://tomesphere.com/paper/1908.06758/full.md

## References

29 references — full list in the complete paper: https://tomesphere.com/paper/1908.06758/full.md

---
Source: https://tomesphere.com/paper/1908.06758