A Fixed Candidate Set under an Opportunity-Cost Bound
Abstract
An opportunity-cost bound concerns loss within its mathematical setup, while a fixed-candidate procedure defines which designs can be compared. Their common limitation is the unenumerated alternative. Evaluation should distinguish incorrect selection within the list from inadequate candidate coverage, retaining the bound's assumptions rather than reporting it as measured field loss. This focused synthesis develops an empirical comparison that preserves the terminal action, observation process, and total verification cost. Its proposed tests are prospective; no new simulation run, model-training result, or intervention effect is reported.
References
- S. Gao and L. Shi, “Selecting the Best Simulated Design with the Expected Opportunity Cost Bound,” IEEE Transactions on Automatic Control, vol. 60, no. 10, pp. 2785–2790, 2015.
- S. Gao and L. Shi, “An Optimal Opportunity Cost Selection Procedure for a Fixed Number of Designs,” Proceedings of the 2014 Winter Simulation Conference, pp. 3952–3958, 2014.
- Glasserman, Paul. Monte Carlo Methods in Financial Engineering. Springer, 2004. https://doi.org/10.1007/978-0-387-21617-1.
- Ankenman, Bruce, Barry L. Nelson, and Jeremy Staum. “Stochastic Kriging for Simulation Metamodeling.” Operations Research, vol. 58, no. 2, 2010, pp. 371–382. https://doi.org/10.1287/opre.1090.0754.
- Kim, Seong-Hee, and Barry L. Nelson. “A Fully Sequential Procedure for Indifference-Zone Selection in Simulation.” ACM Transactions on Modeling and Computer Simulation, vol. 11, no. 3, 2001, pp. 251–273. https://doi.org/10.1145/502109.502111.
- Chick, Stephen E., and Koichiro Inoue. “New Two-Stage and Sequential Procedures for Selecting the Best Simulated System.” Operations Research, vol. 49, no. 5, 2001, pp. 732–743. https://doi.org/10.1287/opre.49.5.732.10615.
- Frazier, Peter I., Warren B. Powell, and Savas Dayanik. “A Knowledge-Gradient Policy for Sequential Information Collection.” SIAM Journal on Control and Optimization, vol. 47, no. 5, 2008, pp. 2410–2439. https://doi.org/10.1137/070693424.
- Rasmussen, Carl Edward, and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006. https://gaussianprocess.org/gpml/.
- Sacks, Jerome, William J. Welch, Toby J. Mitchell, and Henry P. Wynn. “Design and Analysis of Computer Experiments.” Statistical Science, vol. 4, no. 4, 1989, pp. 409–423. https://doi.org/10.1214/ss/1177012413.
- Bertsimas, Dimitris, and Melvyn Sim. “The Price of Robustness.” Operations Research, vol. 52, no. 1, 2004, pp. 35–53. https://doi.org/10.1287/opre.1030.0065.