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. 2303.10565
  4. Cited By
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games

Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games

19 March 2023
Arnab Maiti
Kevin G. Jamieson
Lillian J. Ratliff
ArXivPDFHTML

Papers citing "Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games"

2 / 2 papers shown
Title
Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits
Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits
Shang Lu
Shuji Kijima
31
0
0
08 May 2025
Near-Optimal Pure Exploration in Matrix Games: A Generalization of
  Stochastic Bandits & Dueling Bandits
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
Arnab Maiti
Ross Boczar
Kevin G. Jamieson
Lillian J. Ratliff
17
4
0
25 Oct 2023
1