"Near-Optimal Pure Exploration in Matrix Games: A Generalization of ..."

Arnab Maiti et al. (2024)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-05-13

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/aistats/MaitiBJR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aistats/MaitiBJR24
Arnab Maiti, Ross Boczar, Kevin G. Jamieson, Lillian J. Ratliff:
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits. AISTATS 2024: 2602-2610

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.