Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation

13 February 2023

Papers citing "Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation"

7 / 7 papers shown

Title
Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games Tong Yang Bo Dai Lin Xiao Yuejie Chi OffRL 61 2 0 13 Feb 2025
Refined Sample Complexity for Markov Games with Independent Linear Function Approximation Yan Dai Qiwen Cui S. S. Du 44 1 0 11 Feb 2024
Multi-Player Zero-Sum Markov Games with Networked Separable Interactions Chanwoo Park Kaipeng Zhang Asuman Ozdaglar 30 8 0 13 Jul 2023
Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation A. Ghosh 15 1 0 28 Nov 2022
A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games Wei Xiong Han Zhong Chengshuai Shi Cong Shen Tong Zhang 63 18 0 04 Oct 2022
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent Yu Bai Chi Jin Song Mei Ziang Song Tiancheng Yu OffRL 52 19 0 30 May 2022
Sample-Efficient Learning of Correlated Equilibria in Extensive-Form Games Ziang Song Song Mei Yu Bai 44 10 0 15 May 2022