ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2402.07082
  4. Cited By
Refined Sample Complexity for Markov Games with Independent Linear
  Function Approximation

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation

11 February 2024
Yan Dai
Qiwen Cui
S. S. Du
ArXivPDFHTML

Papers citing "Refined Sample Complexity for Markov Games with Independent Linear Function Approximation"

4 / 4 papers shown
Title
Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
Tong Yang
Bo Dai
Lin Xiao
Yuejie Chi
OffRL
56
2
0
13 Feb 2025
RL in Markov Games with Independent Function Approximation: Improved
  Sample Complexity Bound under the Local Access Model
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model
Junyi Fan
Yuxuan Han
Jialin Zeng
Jian-Feng Cai
Yang Wang
Yang Xiang
Jiheng Zhang
19
1
0
18 Mar 2024
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits
Julia Olkhovskaya
J. Mayo
T. Erven
Gergely Neu
Chen-Yu Wei
51
10
0
01 May 2023
A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games
A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games
Wei Xiong
Han Zhong
Chengshuai Shi
Cong Shen
Tong Zhang
53
19
0
04 Oct 2022
1