STAS: Spatial-Temporal Return Decomposition for Multi-agent Reinforcement Learning

Sirui Chen*, Zhaowei Zhang*, Yaodong Yang, Yali Du

Proceedings of the AAAI Conference on Artificial Intelligence (AAAI),

PDF BibTeX

Cite this paper

@article{Chen_Zhang_Yang_Du_2024, 
title={STAS: Spatial-Temporal Return Decomposition for Solving Sparse Rewards Problems in Multi-agent Reinforcement Learning},
journal={Proceedings of the AAAI Conference on Artificial Intelligence},
year = {2024},
author={Chen, Sirui and Zhang, Zhaowei and Yang, Yaodong and Du, Yali}
}
Code DOI

Abstract:

Centralized Training with Decentralized Execution (CTDE) has been proven to be an effective paradigm in cooperative multi-agent reinforcement learning (MARL). One of the major challenges is credit assignment, which aims to credit agents by their contributions. While prior studies have shown great success, their methods typically fail to work in episodic reinforcement learning scenarios where global rewards are revealed only at the end of the episode. They lack the functionality to model complicated relations of the delayed global reward in the temporal dimension and suffer from inefficiencies. To tackle this, we introduce Spatial-Temporal Attention with Shapley (STAS), a novel method that learns credit assignment in both temporal and spatial dimensions. It first decomposes the global return back to each time step, then utilizes the Shapley Value to redistribute the individual payoff from the decomposed global reward. To mitigate the computational complexity of the Shapley Value, we introduce an approximation of marginal contribution and utilize Monte Carlo sampling to estimate it. We evaluate our method on an Alice & Bob example and MPE environments across different scenarios. Our results demonstrate that our method effectively assigns spatial-temporal credit, outperforming all state-of-the-art baselines.