Indifference-Zone-Free Selection of the Best

被引:59
作者
Fan, Weiwei [1 ]
Hong, L. Jeff [2 ,3 ]
Nelson, Barry L. [4 ]
机构
[1] Univ Sci & Technol China, Sch Management, Dept Management Sci, Hefei, Peoples R China
[2] City Univ Hong Kong, Coll Business, Dept Econ & Finance, Kowloon Tong, Hong Kong, Peoples R China
[3] City Univ Hong Kong, Coll Business, Dept Management Sci, Kowloon Tong, Hong Kong, Peoples R China
[4] Northwestern Univ, Dept Ind Engn & Management Sci, Evanston, IL 60208 USA
关键词
selection of the best; indifference-zone-free; fully sequential procedures; OF-THE-BEST; SEQUENTIAL-PROCEDURES; RANKING; PROBABILITY; 2-STAGE;
D O I
10.1287/opre.2016.1530
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Many procedures have been proposed in the literature to select the simulated alternative with the best mean performance from a finite set of alternatives. Among these procedures, frequentist procedures are typically designed under either the subset-selection (SS) formulation or the indifference-zone (IZ) formulation. Both formulations may encounter problems when the goal is to select the unique best alternative for any configuration of the means. In particular, SS procedures may return a subset that contains more than one alternative, and IZ procedures hinge on the relationship between the chosen IZ parameter and the true mean differences that is unknown to decision makers a priori. In this paper, we propose a new formulation that guarantees to select the unique best alternative with a user-specified probability of correct selection (PCS), as long as the means of alternatives are unique, and we design a class of fully sequential procedures under this formulation. These procedures are parameterized by the PCS value only, and their continuation boundaries are determined based on the Law of the Iterated Logarithm. Furthermore, we show that users can add a stopping criterion to these procedures to convert them into IZ procedures, and we argue that these procedures have several advantages over existing IZ procedures. Lastly, we conduct an extensive numerical study to show the performance of our procedures and compare their performance to existing procedures.
引用
收藏
页码:1499 / 1514
页数:16
相关论文
共 36 条
[1]  
[Anonymous], 2014, 48 ANN C INFORM SCI
[2]  
Basu D, 1955, SANKHYA, V15, P377
[3]   Fully sequential selection procedures with a parabolic boundary [J].
Batur, Demet ;
Kim, Seong-Hee .
IIE TRANSACTIONS, 2006, 38 (09) :749-764
[4]  
Bechhofer R., 1995, DESIGN ANAL EXPT STA
[5]   A SINGLE-SAMPLE MULTIPLE DECISION PROCEDURE FOR RANKING MEANS OF NORMAL POPULATIONS WITH KNOWN VARIANCES [J].
BECHHOFER, RE .
ANNALS OF MATHEMATICAL STATISTICS, 1954, 25 (01) :16-39
[6]   Selecting a selection procedure [J].
Branke, Juergen ;
Chick, Stephen E. ;
Schmidt, Christian .
MANAGEMENT SCIENCE, 2007, 53 (12) :1916-1932
[7]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[8]   New two-stage and sequential procedures for selecting the best simulated system [J].
Chick, SE ;
Inoue, K .
OPERATIONS RESEARCH, 2001, 49 (05) :732-743
[9]   Sequential Sampling with Economics of Selection Procedures [J].
Chick, Stephen E. ;
Frazier, Peter .
MANAGEMENT SCIENCE, 2012, 58 (03) :550-569
[10]  
Clark G. M., 1986, 1986 Winter Simulation Conference Proceedings, P313, DOI 10.1145/318242.318452