Ranking and Contextual Selection

Published Online:https://doi.org/10.1287/opre.2023.0378

References

  • Agrawal S, Avadhanula V, Goyal V, Zeevi A (2019) MNL-bandit: A dynamic learning approach to assortment selection. Oper. Res. 67(5):1453–1485.LinkGoogle Scholar
  • Alban A, Chick SE, Zoumpoulis SI (2021) Expected value of information methods for contextual ranking and selection: Clinical trials and simulation optimization. Kim S, Feng B, Smith K, Masoud S, Zheng Z, eds. Proc. 2021 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1–12.Google Scholar
  • Bergman D, Huang T, Brooks P, Lodi A, Raghunathan AU (2022) Janos: An integrated predictive and prescriptive modeling framework. INFORMS J. Comput. 34(2):807–816.LinkGoogle Scholar
  • Bouneffouf D, Rish I, Aggarwal C (2020) Survey on applications of multi-armed and contextual bandits. 2020 IEEE Congress Evolutionary Comput. (IEEE, Piscataway, NJ), 1–8.Google Scholar
  • Cakmak S, Zhou E, Gao S (2021) Contextual ranking and selection with Gaussian processes. Kim S, Feng B, Smith K, Masoud S, Zheng Z, eds. Proc. 2021 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1–12.Google Scholar
  • Chen CH, Lee LH (2011) Stochastic Simulation Optimization: An Optimal Computing Budget Allocation, vol. 1 (World Scientific, Hackensack, NJ).Google Scholar
  • Chen X, Wang Y, Zhou Y (2020) Dynamic assortment optimization with changing contextual information. J. Machine Learn. Res. 21(1):8918–8961.Google Scholar
  • Chen X, Owen Z, Pixton C, Simchi-Levi D (2022) A statistical learning approach to personalization in revenue management. Management Sci. 68(3):1923–1937.LinkGoogle Scholar
  • Ding L, Hong LJ, Shen H, Zhang X (2022) Knowledge gradient for selection with covariates: Consistency and computation. Naval Res. Logist. 69(3):496–507.CrossrefGoogle Scholar
  • Du J, Gao S, Chen CH (2022) A contextual ranking and selection method for personalized medicine. Preprint, submitted June 25, https://arxiv.org/abs/2206.12640.Google Scholar
  • Eckman DJ, Henderson SG (2018) Guarantees on the probability of good selection. Rabe M, Juan AA, Mustafee N, Skoogh A, Jian S, Johansson B, eds. Proc. 2018 Winter Simulation Conf. (IEEE, Piscataway, NJ), 351–365.Google Scholar
  • Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize”. Management Sci. 68(1):9–26.LinkGoogle Scholar
  • Gao S, Du J, Chen CH (2019) Selecting the optimal system design under covariates. Reveliotis S, Capalleri D, Dimarogonas D, Dotoli M, Fanti M, Lutz P, Seatzu C, Xie X, eds. Proc. 15th Internat. Conf. Automation Sci. Engrg. (IEEE, Piscataway, NJ), 547–552.Google Scholar
  • Hunter SR, Nelson BL (2017) Parallel ranking and selection. Tolk A, Fowler J, Shao G, Yücesan E, eds. Adv. Modeling Simulation: Seminal Research 50 Years Winter Simulation Conf. (Springer, New York), 249–275.Google Scholar
  • Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper. Res. 68(4):1020–1037.LinkGoogle Scholar
  • Keslin G, Nelson BL, Plumlee M, Pagnoncelli BK, Rahimian H (2022) A classification method for ranking and selection with covariates. Feng B, Yijie P, Pedrielli G, Eunhye S, Shashaani S, Corlu CG, eds. Proc. 2022 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1–12.Google Scholar
  • Kim SH, Nelson BL (2001) A fully sequential procedure for indifference-zone selection in simulation. ACM Trans. Model. Comput. Simulation 11(3):251–273.CrossrefGoogle Scholar
  • Li H, Lam H, Peng Y (2024) Efficient learning for clustering and optimizing context-dependent designs. Oper. Res. 72(2):617–638.LinkGoogle Scholar
  • Li X, Zhang X, Zheng Z (2018) Data-driven ranking and selection: High-dimensional covariates and general dependence. Rabe M, Juan AA, Mustafee N, Skoogh A, Jian S, Johansson B, eds. Proc. 2018 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1933–1944.Google Scholar
  • Li H, Lam H, Liang Z, Peng Y (2020) Context-dependent ranking and selection under a Bayesian framework. Bae KHG, Feng B, Kim S, Lazarova-Molnar S, Zheng Z, Roeder T, Thiesing R, eds. Proc. 2020 Winter Simulation Conf. (IEEE, Piscataway, NJ), 2060–2070.Google Scholar
  • Liu H, Xiao H, Li H, Lee LH, Chew EP (2022) Offline sequential learning via simulation. IISE Trans. 54(11):1019–1032.CrossrefGoogle Scholar
  • Lobel I (2021) Revenue management and the rise of the algorithmic economy. Management Sci. 67(9):5389–5398.LinkGoogle Scholar
  • Miao S, Chao X (2022) Online personalized assortment optimization with high-dimensional customer contextual data. Manufacturing Service Oper. Management 24(5):2741–2760.LinkGoogle Scholar
  • Nelson BL, Matejcik FJ (1995) Using common random numbers for indifference-zone selection and multiple comparisons in simulation. Management Sci. 41(12):1935–1945.LinkGoogle Scholar
  • Rhodes-Leader L, Nelson B, Onggo BS, Worthington D (2022) A multi-fidelity modelling approach for airline disruption management using simulation. J. Oper. Res. Soc. 73(10):2228–2241.CrossrefGoogle Scholar
  • Rusmevichientong P, Shen ZJM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.LinkGoogle Scholar
  • Ryzhov IO (2016) On the convergence rates of expected improvement methods. Oper. Res. 64(6):1515–1528.LinkGoogle Scholar
  • Sauré D, Zeevi A (2013) Optimal dynamic assortment planning with demand learning. Manufacturing Service Oper. Management 15(3):387–404.LinkGoogle Scholar
  • Shen H, Hong LJ, Zhang X (2021) Ranking and selection with covariates for personalized decision making. INFORMS J. Comput. 33(4):1500–1519.AbstractGoogle Scholar
  • Vovk V, Gammerman A, Shafer G (2005) Algorithmic Learning in a Random World, vol. 29 (Springer, New York).Google Scholar
  • Wilder B, Ewing E, Dilkina B, Tambe M (2019) End to end learning and optimization on graphs. Wallach H, Larochelle H, Beygelzimer A, d’Alch’e-Buc F, Fox E, Garnett R, eds. Adv. Neural Inform. Processing Systems, vol. 32 (Curran Associates, Inc., Red Hook, NY), 4674–4685.Google Scholar
  • Zhang G, Chen S, Peng Y (2023) Efficient learning for selecting top-m context-dependent designs. Preprint, submitted May 6, https://arxiv.org/abs/2305.04086.Google Scholar
  • Zhong Y, Hong LJ (2018) Fully sequential ranking and selection procedures with PAC guarantee. Rabe M, Juan AA, Mustafee N, Skoogh A, Jian S, Johansson B, eds. Proc. 2018 Winter Simulation Conf. (IEEE, Piscataway, NJ), 1898–1908.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.