News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

Finite-time Analysis of the Multiarmed Bandit Problem

Peter Auer; Nicolò Cesa‐Bianchi; Paul Fischer · Machine Learning · 2002

Resource page
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Peter Auer; Nicolò Cesa‐Bianchi; Paul Fischer
Publisher
Machine Learning
Year
2002
Language
English

Resource access

Open the content from the main option or choose another available source.

OpenAlex OpenAlex Works
Entrar por OpenAlex
Main access

Resource page

Resource reference page. Full text availability has not been automatically confirmed.
Open resource

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Auer, P, Cesa‐Bianchi, N, & Fischer, P. (2002). Finite-time Analysis of the Multiarmed Bandit Problem. https://doi.org/10.1023/a:1013689704352

MLA

Auer, Peter, et al. "Finite-time Analysis of the Multiarmed Bandit Problem." 2002. https://doi.org/10.1023/a:1013689704352.

Chicago

Auer, Peter, Nicolò Cesa‐Bianchi, and Paul Fischer. 2002. "Finite-time Analysis of the Multiarmed Bandit Problem.". https://doi.org/10.1023/a:1013689704352.

Harvard

Auer, P, Cesa‐Bianchi, N. and Fischer, P. 2002, Finite-time Analysis of the Multiarmed Bandit Problem, Machine Learning, available at: https://doi.org/10.1023/a:1013689704352 [Accessed 8 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Finite-time Analysis of the Multiarmed Bandit Problem
Author / contributors
Peter Auer; Nicolò Cesa‐Bianchi; Paul Fischer
Publisher
Machine Learning
Publication year
2002
Language
English

Subjects

Explore related resources through these subjects.

Regret; Dilemma; Reinforcement learning; Logarithm; Mathematical optimization; Computer science; Mathematical economics; Action (physics); Bounded function; Simple (philosophy); Mathematics; Artificial intelligence
Copied