Selection Procedures with Frequentist Expected Opportunity Cost Bounds
Stephen E. Chick () and
Yaozhong Wu ()
Additional contact information
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
Operations Research, 2005, vol. 53, issue 5, 867-878
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.
Keywords: simulation: ranking and selection; statistical analysis (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0187 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:53:y:2005:i:5:p:867-878
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().