IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v324y2025i1p168-182.html
   My bibliography  Save this article

The multi-armed bandit problem under the mean-variance setting

Author

Listed:
  • Hu, Hongda
  • Charpentier, Arthur
  • Ghossoub, Mario
  • Schied, Alexander

Abstract

The classical multi-armed bandit problem involves a learner and a collection of arms with unknown reward distributions. At each round, the learner selects an arm and receives new information. The learner faces a tradeoff between exploiting the current information and exploring all arms. The objective is to maximize the expected cumulative reward over all rounds. Such an objective does not involve a risk-reward tradeoff, which is fundamental in many areas of application. In this paper, we build upon Sani et al. (2012)’s extension of the classical problem to a mean–variance setting. We relax their assumptions of independent arms and bounded rewards, and we consider sub-Gaussian arms. We introduce the Risk-Aware Lower Confidence Bound algorithm to solve the problem, and study some of its properties. We perform numerical simulations to demonstrate that, in both independent and dependent scenarios, our approach outperforms the algorithm suggested by Sani et al. (2012).

Suggested Citation

  • Hu, Hongda & Charpentier, Arthur & Ghossoub, Mario & Schied, Alexander, 2025. "The multi-armed bandit problem under the mean-variance setting," European Journal of Operational Research, Elsevier, vol. 324(1), pages 168-182.
    • Handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:168-182
    DOI: 10.1016/j.ejor.2025.03.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725002085
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.03.011?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:168-182. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.