IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v27y2025i2p640-658.html

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
    ---><---

    References listed on IDEAS

    as
    1. Arnoud V. den Boer & N. Bora Keskin, 2022. "Dynamic Pricing with Demand Learning and Reference Effects," Management Science, INFORMS, vol. 68(10), pages 7112-7130, October.
    2. Stefanos A. Zenios & Glenn M. Chertow & Lawrence M. Wein, 2000. "Dynamic Allocation of Kidneys to Candidates on the Transplant Waiting List," Operations Research, INFORMS, vol. 48(4), pages 549-569, August.
    3. Gah-Yi Ban & N. Bora Keskin, 2021. "Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity," Management Science, INFORMS, vol. 67(9), pages 5549-5568, September.
    4. Aurélien Garivier & Pierre Ménard & Gilles Stoltz, 2019. "Explore First, Exploit Next: The True Shape of Regret in Bandit Problems," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 377-399, May.
    5. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2011. "The Price of Fairness," Operations Research, INFORMS, vol. 59(1), pages 17-31, February.
    6. Arielle Anderer & Hamsa Bastani & John Silberholz, 2022. "Adaptive Clinical Trial Designs with Surrogates: When Should We Bother?," Management Science, INFORMS, vol. 68(3), pages 1982-2002, March.
    7. Alessandro Arlotto & Stephen E. Chick & Noah Gans, 2014. "Optimal Hiring and Retention Policies for Heterogeneous Workers Who Learn," Management Science, INFORMS, vol. 60(1), pages 110-129, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chonghuan Wang, 2026. "Experimental Design for Matching," Papers 2601.21036, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maxime C. Cohen & Sentao Miao & Yining Wang, 2025. "Dynamic Pricing with Fairness Constraints," Operations Research, INFORMS, vol. 73(6), pages 3027-3043, November.
    2. Yonatan Gur & Ahmadreza Momeni, 2022. "Adaptive Sequential Experiments with Unknown Information Arrival Processes," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2666-2684, September.
    3. N. Bora Keskin & Yuexing Li & Jing-Sheng Song, 2022. "Data-Driven Dynamic Pricing and Ordering with Perishable Inventory in a Changing Environment," Management Science, INFORMS, vol. 68(3), pages 1938-1958, March.
    4. Yanhan (Savannah) Tang & Alan Scheller-Wolf & Sridhar Tayur & Emily R. Perito & John P. Roberts, 2025. "Split Liver Transplantation: An Analytical Decision Support Model," Operations Research, INFORMS, vol. 73(4), pages 1785-1804, July.
    5. Tao Shen & Yifan Cui, 2026. "Proxy-Aided Demand Learning with an Application to Various Pricing Problems," Operations Research, INFORMS, vol. 74(2), pages 770-787, March.
    6. John R. Birge & Hongfan (Kevin) Chen & N. Bora Keskin & Amy Ward, 2024. "To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment," Operations Research, INFORMS, vol. 72(6), pages 2391-2412, November.
    7. Gemma Berenguer & Zuo-Jun (Max) Shen, 2020. "OM Forum—Challenges and Strategies in Managing Nonprofit Operations: An Operations Management Perspective," Manufacturing & Service Operations Management, INFORMS, vol. 22(5), pages 888-905, September.
    8. Junyu Cao & Wei Sun, 2024. "Tiered Assortment: Optimization and Online Learning," Management Science, INFORMS, vol. 70(8), pages 5481-5501, August.
    9. Bian, Bei & Wang, Haiyan, 2025. "Quality management and feedback operation for user-generated content considering dynamic value belief," European Journal of Operational Research, Elsevier, vol. 325(2), pages 344-361.
    10. Ningyuan Chen & Ming Hu, 2023. "Frontiers in Service Science: Data-Driven Revenue Management: The Interplay of Data, Model, and Decisions," Service Science, INFORMS, vol. 15(2), pages 79-91, June.
    11. Xiao, Yikang & Mou, Yuting & Pan, Bo & Yang, Min, 2025. "The design of a time-of-use tariff with a demand charge for residential electric vehicle charging posts," Utilities Policy, Elsevier, vol. 97(C).
    12. Xuejun Zhao & Ruihao Zhu & William B. Haskell, 2026. "Learning to Price Supply Chain Contracts Against a Learning Retailer," Management Science, INFORMS, vol. 72(3), pages 2168-2187, March.
    13. Jianyu Xu & Yining Wang & Xi Chen & Yu-Xiang Wang, 2025. "Dynamic Pricing with Adversarially-Censored Demands," Papers 2502.06168, arXiv.org, revised Jan 2026.
    14. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List," Operations Research, INFORMS, vol. 55(1), pages 24-36, February.
    15. Shai Vardi & Alexandros Psomas & Eric Friedman, 2022. "Dynamic Fair Resource Division," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 945-968, May.
    16. Arian Aflaki & Qian (Ken) Zhang, 2026. "Is Your Price Personalized? Alleviating Customer Concerns with Inventory Availability Information," Operations Research, INFORMS, vol. 74(1), pages 181-198, January.
    17. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    18. Murça, Mayara Condé Rocha, 2018. "Collaborative air traffic flow management: Incorporating airline preferences in rerouting decisions," Journal of Air Transport Management, Elsevier, vol. 71(C), pages 97-107.
    19. Dixit, Aasheesh & Jakhar, Suresh Kumar, 2021. "Airport capacity management: A review and bibliometric analysis," Journal of Air Transport Management, Elsevier, vol. 91(C).
    20. Farhad Hamidzadeh & Mir Saman Pishvaee & Naeme Zarrinpoor, 2024. "A novel two-stage network data envelopment analysis model for kidney allocation problem under medical and logistical uncertainty: a real case study," Health Care Management Science, Springer, vol. 27(4), pages 555-579, December.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.