IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v27y2025i2p640-658.html
   My bibliography  Save this article

Multi-Armed Bandits with Endogenous Learning Curves: An Application to Split Liver Transplantation

Author

Listed:
  • Yanhan (Savannah) Tang

    (Cox School of Business, Southern Methodist University, Dallas, Texas 75275)

  • Andrew Li

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Alan Scheller-Wolf

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Sridhar Tayur

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

Problem Definition: Proficiency in many sophisticated tasks is attained through experience-based learning, in other words, learning by doing. For example, transplant centers’ surgical teams need to practice difficult surgeries to master the skills required. Meanwhile, this experience-based learning may affect other stakeholders, such as patients eligible for transplant surgeries, and require resources, including scarce organs and continual efforts. To ensure that patients have excellent outcomes and equitable access to organs, the organ allocation authority needs to quickly identify and develop medical teams with high aptitudes. This entails striking a balance between exploring surgical combinations with initially unknown full potential and exploiting existing knowledge based on observed outcomes. Methodology/results: We formulate a multi-armed bandit (MAB) model in which parametric learning curves are embedded in the reward functions to capture endogenous experience-based learning. In addition, our model includes provisions ensuring that the choices of arms are subject to fairness constraints to guarantee equity. To solve our MAB problem, we propose the L-UCB and FL-UCB algorithms, variants of the upper confidence bound (UCB) algorithm that attain the optimal O ( log t ) regret on problems enhanced with experience-based learning and fairness concerns. We demonstrate our model and algorithms on the split liver transplantation (SLT) allocation problem, showing that our algorithms have superior numerical performance compared with standard bandit algorithms in a setting where experience-based learning and fairness concerns exist. Managerial implications: From a methodological point of view, our proposed MAB model and algorithms are generic and have broad application prospects. From an application standpoint, our algorithms could be applied to help evaluate potential strategies to increase the proliferation of SLT and other technically difficult procedures.

Suggested Citation

  • Yanhan (Savannah) Tang & Andrew Li & Alan Scheller-Wolf & Sridhar Tayur, 2025. "Multi-Armed Bandits with Endogenous Learning Curves: An Application to Split Liver Transplantation," Manufacturing & Service Operations Management, INFORMS, vol. 27(2), pages 640-658, March.
  • Handle: RePEc:inm:ormsom:v:27:y:2025:i:2:p:640-658
    DOI: 10.1287/msom.2022.0412
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.0412
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.0412?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
    ---><---

    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:inm:ormsom:v:27:y:2025:i:2:p:640-658. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.