IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i5p867-878.html
   My bibliography  Save this article

Selection Procedures with Frequentist Expected Opportunity Cost Bounds

Author

Listed:
  • Stephen E. Chick

    (Technology Management Area, INSEAD, Boulevard de Constance, 77305 Fontainebleau Cedex, France)

  • Yaozhong Wu

    (Technology Management Area, INSEAD, Boulevard de Constance, 77305 Fontainebleau Cedex, France)

Abstract

Selection procedures help identify the best of a finite set of simulated alternatives. Most work has measured the quality of a selection with the probability of correct selection, P(CS), but the expected opportunity cost of a potentially incorrect decision makes more sense in business contexts. This paper analyzes the first selection procedures that guarantee an upper bound for the expected opportunity cost, in a frequentist sense, of a potentially incorrect selection. The paper therefore bridges a gap between the indifference-zone approach (with frequentist guarantees, but for the P(CS)) and the Bayesian approach to selection procedures (which has considered the opportunity cost). We also provide “unexpected” expected opportunity cost guarantees for several existing indifference-zone selection procedures that were originally designed to provide P(CS) guarantees.

Suggested Citation

  • Stephen E. Chick & Yaozhong Wu, 2005. "Selection Procedures with Frequentist Expected Opportunity Cost Bounds," Operations Research, INFORMS, vol. 53(5), pages 867-878, October.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:5:p:867-878
    DOI: 10.1287/opre.1040.0187
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0187
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1040.0187?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. Nathan L. Kleinman & James C. Spall & Daniel Q. Naiman, 1999. "Simulation-Based Optimization with Stochastic Approximation Using Common Random Numbers," Management Science, INFORMS, vol. 45(11), pages 1570-1578, November.
    2. 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.
    3. Barry L. Nelson & Frank J. Matejcik, 1995. "Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in Simulation," Management Science, INFORMS, vol. 41(12), pages 1935-1945, December.
    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. Juergen Branke & Wen Zhang, 2019. "Identifying efficient solutions via simulation: myopic multi-objective budget allocation for the bi-objective case," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 831-865, September.
    2. Yoon, Moonyoung & Bekker, James, 2019. "Considering sample means in Rinott’s procedure with a Bayesian approach," European Journal of Operational Research, Elsevier, vol. 273(1), pages 249-258.
    3. 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.
    4. Jürgen Branke & Stephen E. Chick & Christian Schmidt, 2007. "Selecting a Selection Procedure," Management Science, INFORMS, vol. 53(12), pages 1916-1932, December.
    5. 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.
    6. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    7. Andres Alban & Stephen E. Chick & Martin Forster, 2023. "Value-Based Clinical Trials: Selecting Recruitment Rates and Trial Lengths in Different Regulatory Contexts," Management Science, INFORMS, vol. 69(6), pages 3516-3535, June.
    8. Weiwei Chen & Siyang Gao & Wenjie Chen & Jianzhong Du, 2023. "Optimizing resource allocation in service systems via simulation: A Bayesian formulation," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 65-81, January.

    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. Tsai, Shing Chih, 2011. "Selecting the best simulated system with weighted control-variate estimators," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(4), pages 705-717.
    2. Eric C. Ni & Dragos F. Ciocan & Shane G. Henderson & Susan R. Hunter, 2017. "Efficient Ranking and Selection in Parallel Computing Environments," Operations Research, INFORMS, vol. 65(3), pages 821-836, June.
    3. 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.
    4. Justin Boesel & Barry L. Nelson & Seong-Hee Kim, 2003. "Using Ranking and Selection to “Clean Up” after Simulation Optimization," Operations Research, INFORMS, vol. 51(5), pages 814-825, October.
    5. Michael C. Fu & Jian-Qiang Hu & Chun-Hung Chen & Xiaoping Xiong, 2007. "Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 101-111, February.
    6. Guillermo Durand & Fernando Mele & J. Bandoni, 2012. "Determination of storage tanks location for optimal short-term scheduling in multipurpose/multiproduct batch-continuous plants under uncertainties," Annals of Operations Research, Springer, vol. 199(1), pages 225-247, October.
    7. Emre Barut & Warren Powell, 2014. "Optimal learning for sequential sampling with non-parametric beliefs," Journal of Global Optimization, Springer, vol. 58(3), pages 517-543, March.
    8. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    9. MacKenzie, Cameron A. & Hu, Chao, 2019. "Decision making under uncertainty for design of resilient engineered systems," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    10. Diana M. Negoescu & Peter I. Frazier & Warren B. Powell, 2011. "The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 346-363, August.
    11. Stephen E. Chick & Koichiro Inoue, 2001. "New Two-Stage and Sequential Procedures for Selecting the Best Simulated System," Operations Research, INFORMS, vol. 49(5), pages 732-743, October.
    12. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2005. "Solution quality of random search methods for discrete stochastic optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 68(2), pages 115-125.
    13. Jie Xu & Barry L. Nelson & L. Jeff Hong, 2013. "An Adaptive Hyperbox Algorithm for High-Dimensional Discrete Optimization via Simulation Problems," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 133-146, February.
    14. Barry L. Nelson & David Goldsman, 2001. "Comparisons with a Standard in Simulation Experiments," Management Science, INFORMS, vol. 47(3), pages 449-463, March.
    15. Rafiei, Rezvan & Nourelfath, Mustapha & Gaudreault, Jonathan & De Santa-Eulalia, Luis Antonio & Bouchard, Mathieu, 2015. "Dynamic safety stock in co-production demand-driven wood remanufacturing mills: A case study," International Journal of Production Economics, Elsevier, vol. 165(C), pages 90-99.
    16. Hachicha, Wafik & Ammeri, Ahmed & Masmoudi, Faouzi & Chachoub, Habib, 2010. "A comprehensive literature classification of simulation optimisation methods," MPRA Paper 27652, University Library of Munich, Germany.
    17. 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.
    18. Qiushi Chen & Lei Zhao & Jan C. Fransoo & Zhe Li, 2019. "Dual-mode inventory management under a chance credit constraint," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 147-178, March.
    19. Jing Xie & Peter I. Frazier & Stephen E. Chick, 2016. "Bayesian Optimization via Simulation with Pairwise Sampling and Correlated Prior Beliefs," Operations Research, INFORMS, vol. 64(2), pages 542-559, April.
    20. Ekin, Tahir & Naveiro, Roi & Ríos Insua, David & Torres-Barrán, Alberto, 2023. "Augmented probability simulation methods for sequential games," European Journal of Operational Research, Elsevier, vol. 306(1), pages 418-430.

    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:oropre:v:53:y:2005:i:5:p:867-878. 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.