atlas

Research map / Multi-agent systems and games / Cooperative multi-agent RL

Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation

ICML 2023 · Multi-agent systems and games › Cooperative multi-agent RL · approach: Decentralized actor-critic MARL · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use asynchronous, determinant-triggered communication instead of synchronous round-robin communicationCooperative linear MDP learning · Linear MDPscommunication complexity: $d H M^3$ -> $d H M^2$Helped
Use asynchronous communication while preserving the regret guaranteeCooperative linear MDP learning · Linear MDPsregret: $d^{3/2} H^2 \sqrt{K}$ -> $d^{3/2}H^2\sqrt{K} $No clear effect
Restrict communication complexity to less than $dM/11400$Any cooperative linear-MDP algorithm · Linear MDPs with $d,H\ge 2$ and $K\ge dM$regret lower bound: $\Omega(H\sqrt{dMK})$Hurt
Set the communication-trigger parameter to $\alpha = 1/M^2$ and $\lambda = 1$Async-Coop-LSVI-UCB · Linear MDPscommunication complexity: $\tilde{\mathcal{O}}(dH(M+1/\alpha))$ -> $\tilde{\mathcal{O}}(dHM^2)$Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy