Bandit problems with Lévy processes

From MaRDI portal
Publication:5169656

DOI10.1287/MOOR.1120.0564zbMATH Open1304.60048arXiv1407.7241OpenAlexW2111787450MaRDI QIDQ5169656FDOQ5169656


Authors: Asaf Cohen, Eilon Solan Edit this on Wikidata


Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Abstract: Bandit problems model the trade-off between exploration and exploitation in various decision problems. We study two-armed bandit problems in continuous time, where the risky arm can have two types: High or Low; both types yield stochastic payoffs generated by a Levy process. We show that the optimal strategy is a cut-off strategy and we provide an explicit expression for the cut-off and for the optimal payoff.


Full work available at URL: https://arxiv.org/abs/1407.7241




Recommendations





Cited In (17)





This page was built for publication: Bandit problems with Lévy processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169656)