article · 2022

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem

Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Agarwal, A., Ghuge, R., & Nagarajan, V. (2022). An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem. https://doi.org/10.52202/068431-2096

MLA 9

Agarwal, Arpit, et al. “An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem.” 2022, pp. 28914–27, https://doi.org/10.52202/068431-2096.

Chicago

Agarwal, Arpit, Rohan Ghuge, and Viswanath Nagarajan. 2022. “An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem.” https://doi.org/10.52202/068431-2096.

Harvard

Agarwal, A., Ghuge, R. and Nagarajan, V. (2022) ‘An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem’. Available at: https://doi.org/10.52202/068431-2096.

BibTeX

@article{agarwal2022asymptotically,
  title = {{An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem}},
  author = {Agarwal, Arpit and Ghuge, Rohan and Nagarajan, Viswanath},
  pages = {28914--28927},
  year = {2022},
  doi = {10.52202/068431-2096}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.