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

A Contextual Ranking and Selection Method for Personalized Medicine

Author

Listed:
  • Jianzhong Du

    (School of Management, Fudan University, Shanghai 200433, China)

  • Siyang Gao

    (Department of Systems Engineering and School of Data Science, City University of Hong Kong, Hong Kong, China)

  • Chun-Hung Chen

    (Department of Systems Engineering and Operations Research, George Mason University, Fairfax, Virginia 22030)

Abstract

Problem definition : Personalized medicine (PM) seeks the best treatment for each patient among a set of available treatment methods. Because a specific treatment does not work well on all patients, traditionally, the best treatment was selected based on the doctor’s personal experience and expertise, which is subject to human errors. In the meantime, stochastic models have been well developed in the literature for a lot of major diseases. This gives rise to a simulation-based solution for PM, which uses the simulation tool to evaluate the performance for pairs of treatment and patient biometric characteristics and, based on that, selects the best treatment for each patient characteristic. Methodology/results : In this research, we extend the ranking and selection (R&S) model in simulation-based decision making to solving PM. The biometric characteristics of a patient are treated as a context for R&S, and we call it contextual ranking and selection (CR&S). We consider two formulations of CR&S with small and large context spaces, respectively, and develop new techniques for solving them and identifying the rate-optimal budget allocation rules. Based on them, two selection algorithms are proposed, which can be shown to be numerically superior via a set of tests on abstract and real-world examples. Managerial implications : This research provides a systematic way of conducting simulation-based decision-making for PM. To improve the overall decision quality for the possible contexts, more simulation efforts should be devoted to contexts in which it is difficult to distinguish between the best treatment and non-best treatments, and our results quantify the optimal trade-off of the simulation efforts between the pairs of contexts and treatments.

Suggested Citation

  • Jianzhong Du & Siyang Gao & Chun-Hung Chen, 2024. "A Contextual Ranking and Selection Method for Personalized Medicine," Manufacturing & Service Operations Management, INFORMS, vol. 26(1), pages 167-181, January.
  • Handle: RePEc:inm:ormsom:v:26:y:2024:i:1:p:167-181
    DOI: 10.1287/msom.2022.0232
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/msom.2022.0232?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. Laura McLay & Christodoulos Foufoulides & Jason Merrick, 2010. "Using simulation-optimization to construct screening strategies for cervical cancer," Health Care Management Science, Springer, vol. 13(4), pages 294-318, December.
    2. Haihui Shen & L. Jeff Hong & Xiaowei Zhang, 2021. "Ranking and Selection with Covariates for Personalized Decision Making," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1500-1519, October.
    3. Barry L. Nelson & Julie Swann & David Goldsman & Wheyming Song, 2001. "Simple Procedures for Selecting the Best Simulated System When the Number of Alternatives is Large," Operations Research, INFORMS, vol. 49(6), pages 950-963, December.
    4. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    5. Daniel Russo, 2020. "Simple Bayesian Algorithms for Best-Arm Identification," Operations Research, INFORMS, vol. 68(6), pages 1625-1647, November.
    6. Alan Brennan & Stephen E. Chick & Ruth Davies, 2006. "A taxonomy of model structures for economic evaluation of health technologies," Health Economics, John Wiley & Sons, Ltd., vol. 15(12), pages 1295-1310, December.
    7. Stephen E. Chick & Hamed Mamani & David Simchi-Levi, 2008. "Supply Chain Coordination and Influenza Vaccination," Operations Research, INFORMS, vol. 56(6), pages 1493-1506, December.
    8. Ilya O. Ryzhov, 2016. "On the Convergence Rates of Expected Improvement Methods," Operations Research, INFORMS, vol. 64(6), pages 1515-1528, December.
    9. Nicholas J. Schork, 2015. "Personalized medicine: Time for one-person trials," Nature, Nature, vol. 520(7549), pages 609-611, April.
    10. Stephen E. Chick & Jürgen Branke & Christian Schmidt, 2010. "Sequential Sampling to Myopically Maximize the Expected Value of Information," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 71-80, February.
    11. Elliot Lee & Mariel S. Lavieri & Michael Volk, 2019. "Optimal Screening for Hepatocellular Carcinoma: A Restless Bandit Model," Service Science, INFORMS, vol. 21(1), pages 198-212, January.
    12. Siyang Gao & Weiwei Chen & Leyuan Shi, 2017. "A New Budget Allocation Framework for the Expected Opportunity Cost," Operations Research, INFORMS, vol. 65(3), pages 787-803, June.
    13. Diana M. Negoescu & Kostas Bimpikis & Margaret L. Brandeau & Dan A. Iancu, 2018. "Dynamic Learning of Patient Response Types: An Application to Treating Chronic Diseases," Management Science, INFORMS, vol. 64(8), pages 3469-3488, August.
    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. Wang, Tianxiang & Xu, Jie & Branke, Juergen & Hu, Jian-Qiang & Chen, Chun-Hung, 2025. "Ranking and selection with two-stage decision," European Journal of Operational Research, Elsevier, vol. 322(1), pages 121-132.
    2. Taeho Kim & Kyoung-Kuk Kim & Eunhye Song, 2025. "Selection of the Most Probable Best," Operations Research, INFORMS, vol. 73(6), pages 3199-3218, November.
    3. Hu, Mingjie & Xu, Jie & Chen, Chun-Hung & Hu, Jian-Qiang, 2025. "Optimal computation budget allocation with Gaussian process regression," European Journal of Operational Research, Elsevier, vol. 322(1), pages 147-156.
    4. Li, Dongyang & Chew, Ek Peng & Li, Haobin & Yücesan, Enver & Chen, Chun-Hung, 2026. "Efficient simulation budget allocation for contextual ranking and selection with quadratic models," European Journal of Operational Research, Elsevier, vol. 328(3), pages 862-876.

    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. Wang, Tianxiang & Xu, Jie & Branke, Juergen & Hu, Jian-Qiang & Chen, Chun-Hung, 2025. "Ranking and selection with two-stage decision," European Journal of Operational Research, Elsevier, vol. 322(1), pages 121-132.
    2. Li, Dongyang & Chew, Ek Peng & Li, Haobin & Yücesan, Enver & Chen, Chun-Hung, 2026. "Efficient simulation budget allocation for contextual ranking and selection with quadratic models," European Journal of Operational Research, Elsevier, vol. 328(3), pages 862-876.
    3. L. Jeff Hong & Guangxin Jiang & Ying Zhong, 2022. "Solving Large-Scale Fixed-Budget Ranking and Selection Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2930-2949, November.
    4. Ye Chen & Ilya O. Ryzhov, 2023. "Balancing Optimal Large Deviations in Sequential Selection," Management Science, INFORMS, vol. 69(6), pages 3457-3473, June.
    5. Cheng Li & Siyang Gao & Jianzhong Du, 2023. "Convergence Analysis of Stochastic Kriging-Assisted Simulation with Random Covariates," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 386-402, March.
    6. Haidong Li & Henry Lam & Yijie Peng, 2024. "Efficient Learning for Clustering and Optimizing Context-Dependent Designs," Operations Research, INFORMS, vol. 72(2), pages 617-638, March.
    7. Taeho Kim & Kyoung-Kuk Kim & Eunhye Song, 2025. "Selection of the Most Probable Best," Operations Research, INFORMS, vol. 73(6), pages 3199-3218, November.
    8. Zhongshun Shi & Siyang Gao & Hui Xiao & Weiwei Chen, 2019. "A worst‐case formulation for constrained ranking and selection with input uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(8), pages 648-662, December.
    9. Zhongshun Shi & Yijie Peng & Leyuan Shi & Chun-Hung Chen & Michael C. Fu, 2022. "Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 557-568, January.
    10. Cao, Zirui & Wang, Haowei & Chew, Ek Peng & Li, Haobin & Tan, Kok Choon, 2025. "A budget-adaptive allocation rule for optimal computing budget allocation," European Journal of Operational Research, Elsevier, vol. 325(2), pages 247-260.
    11. Yi Zhou & Michael C. Fu & Ilya O. Ryzhov, 2024. "Sequential Learning with a Similarity Selection Index," Operations Research, INFORMS, vol. 72(6), pages 2526-2542, November.
    12. Cheng, Zhenxia & Luo, Jun & Wu, Ruijing, 2023. "On the finite-sample statistical validity of adaptive fully sequential procedures," European Journal of Operational Research, Elsevier, vol. 307(1), pages 266-278.
    13. Jiaqi Zhou & Ilya O. Ryzhov, 2025. "Technical Note—A New Rate-Optimal Sampling Allocation for Linear Belief Models," Operations Research, INFORMS, vol. 73(1), pages 239-250, January.
    14. Linda Pei & Barry L. Nelson & Susan R. Hunter, 2024. "Parallel Adaptive Survivor Selection," Operations Research, INFORMS, vol. 72(1), pages 336-354, January.
    15. Gregory Keslin & Barry L. Nelson & Bernardo Pagnoncelli & Matthew Plumlee & Hamed Rahimian, 2025. "Ranking and Contextual Selection," Operations Research, INFORMS, vol. 73(5), pages 2695-2707, September.
    16. Gongbo Zhang & Yijie Peng & Jianghua Zhang & Enlu Zhou, 2023. "Asymptotically Optimal Sampling Policy for Selecting Top- m Alternatives," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1261-1285, November.
    17. Dohyun Ahn & Dongwook Shin & Assaf Zeevi, 2025. "Feature Misspecification in Sequential Learning Problems," Management Science, INFORMS, vol. 71(5), pages 4066-4086, May.
    18. David J. Eckman & Shane G. Henderson, 2022. "Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1711-1728, May.
    19. Saeid Delshad & Amin Khademi, 2022. "Adaptive Design of Personalized Dose-Finding Clinical Trials," Service Science, INFORMS, vol. 14(4), pages 273-291, December.
    20. Daniel Russo, 2020. "Simple Bayesian Algorithms for Best-Arm Identification," Operations Research, INFORMS, vol. 68(6), pages 1625-1647, November.

    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:26:y:2024:i:1:p:167-181. 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.