Minimax Sample Complexity for Turn-based Stochastic Game

Minimax Sample Complexity for Turn-based Stochastic Game

29 November 2020

Qiwen Cui

ArXiv (abs)PDF HTML

Papers citing "Minimax Sample Complexity for Turn-based Stochastic Game"

11 / 11 papers shown

Title
Settling the Sample Complexity of Online Reinforcement Learning Zihan Zhang Yuxin Chen Jason D. Lee S. Du OffRL 207 25 0 25 Jul 2023
Offline congestion games: How feedback type affects data coverage requirement Haozhe Jiang Qiwen Cui Zhihan Xiong Maryam Fazel S. Du OffRL 64 1 0 24 Oct 2022
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model Gen Li Yuejie Chi Yuting Wei Yuxin Chen 79 18 0 22 Aug 2022
Provably Efficient Offline Multi-agent Reinforcement Learning via Strategy-wise Bonus Qiwen Cui S. Du OffRL 89 21 0 01 Jun 2022
Double Thompson Sampling in Finite stochastic Games Shuqing Shi Xiaobin Wang Zhi-Xuan Yang Fan Zhang Hong Qu 10 0 0 21 Feb 2022
When is Offline Two-Player Zero-Sum Markov Game Solvable? Qiwen Cui S. Du OffRL 77 29 0 10 Jan 2022
Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers? Han Zhong Zhuoran Yang Zhaoran Wang Michael I. Jordan 179 31 0 27 Dec 2021
Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization Shicong Cen Yuting Wei Yuejie Chi 115 79 0 31 May 2021
Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games Zixiang Chen Dongruo Zhou Quanquan Gu 75 25 0 15 Feb 2021
Spectral Methods for Data Science: A Statistical Perspective Yuxin Chen Yuejie Chi Jianqing Fan Cong Ma 157 173 0 15 Dec 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model Gen Li Yuting Wei Yuejie Chi Yuxin Chen 158 131 0 26 May 2020