Decentralized MARL for Coarse Correlated Equilibrium in Aggregative Markov Games

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Huang, Siying, Mu, Yifen, Chen, Ge
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914429935812608
author Huang, Siying
Mu, Yifen
Chen, Ge
author_facet Huang, Siying
Mu, Yifen
Chen, Ge
contents This paper studies the problem of decentralized learning of Coarse Correlated Equilibrium (CCE) in aggregative Markov games (AMGs), where each agent's instantaneous reward depends only on its own action and an aggregate quantity. Existing CCE learning algorithms for general Markov games are not designed to leverage the aggregative structure, and research on decentralized CCE learning for AMGs remains limited. We propose an adaptive stage-based V-learning algorithm that exploits the aggregative structure under a fully decentralized information setting. Based on the two-timescale idea, the algorithm partitions learning into stages and adjusts stage lengths based on the variability of aggregate signals, while using no-regret updates within each stage. We prove the algorithm achieves an epsilon-approximate CCE in O(S Amax T5 / epsilon2) episodes, avoiding the curse of multiagents which commonly arises in MARL. Numerical results verify the theoretical findings, and the decentralized, model-free design enables easy extension to large-scale multi-agent scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2603_27575
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Decentralized MARL for Coarse Correlated Equilibrium in Aggregative Markov Games
Huang, Siying
Mu, Yifen
Chen, Ge
Computer Science and Game Theory
Systems and Control
This paper studies the problem of decentralized learning of Coarse Correlated Equilibrium (CCE) in aggregative Markov games (AMGs), where each agent's instantaneous reward depends only on its own action and an aggregate quantity. Existing CCE learning algorithms for general Markov games are not designed to leverage the aggregative structure, and research on decentralized CCE learning for AMGs remains limited. We propose an adaptive stage-based V-learning algorithm that exploits the aggregative structure under a fully decentralized information setting. Based on the two-timescale idea, the algorithm partitions learning into stages and adjusts stage lengths based on the variability of aggregate signals, while using no-regret updates within each stage. We prove the algorithm achieves an epsilon-approximate CCE in O(S Amax T5 / epsilon2) episodes, avoiding the curse of multiagents which commonly arises in MARL. Numerical results verify the theoretical findings, and the decentralized, model-free design enables easy extension to large-scale multi-agent scenarios.
title Decentralized MARL for Coarse Correlated Equilibrium in Aggregative Markov Games
topic Computer Science and Game Theory
Systems and Control
url https://arxiv.org/abs/2603.27575