Multi-armed Bandit Problem

  • Cesa-Bianchi N
N/ACitations
Citations of this article
111Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multi-armed bandit (MAB) problems are a class of sequential resource allo- cation problems concerned with allocating one or more resources among several alternative (competing) projects. Such problems are paradigms of a fun- damental conflict between making decisions (allocating resources) that yield high current rewards, versus making decisions that sacrifice current gains with the prospect of better future rewards. The MAB formulation models resource allocation problems arising in several technological and scientific disciplines such as sensor management, manufacturing systems, economics, queueing and communication networks, clinical trials, control theory, search theory, etc. (see 88 and references therein).

Cite

CITATION STYLE

APA

Cesa-Bianchi, N. (2014). Multi-armed Bandit Problem. In Encyclopedia of Algorithms (pp. 1–5). Springer US. https://doi.org/10.1007/978-3-642-27848-8_768-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free