Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2310.16252
Cited By
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
25 October 2023
Arnab Maiti
Ross Boczar
Kevin G. Jamieson
Lillian J. Ratliff
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits"
2 / 2 papers shown
Title
Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits
Shang Lu
Shuji Kijima
38
0
0
08 May 2025
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
Arnab Maiti
Kevin G. Jamieson
Lillian J. Ratliff
25
6
0
19 Mar 2023
1