David Goldsman
ABSTRACT
We discuss sampling procedures for selecting that one of a number of normal populations (with common known variance) which has the largest mean. We present procedures appropriate for single-factor experiments, and then give procedures devised for 2-factor experiment's without interaction between the factor-levels. In all cases, the procedures guarantee a prespecified probability of selecting the correct population.
- ilam, K. (1970)."A Two-Sample Procedure for Selecting the Population with the Largest Mean from k Normal Populations." ~nn. Inst. Statist. Math., 2~, 12'7-136.Google Scholar
- Bechhofer, R.E. (1954). "A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with Known Variaaces." Ann. Hath. Star., 25, 16-39.Google ScholarCross Ref
- Bechhofer, R.E. (1980). Book Review of Gibbons, Olkin, and Sobel (1977). J. Amer. Statist., 75, No. 371, 751-756.Google ScholarCross Ref
- Bechllofer, R.E. and D. Goldsman (1987a). "Sequential Selection Procedures for Multi-Factor Experiments Involving Koopman-Darmois Populations with Additivity." Statistical Decision Theory and Related Topics, IV (Eds. S.S. Gupta and J.O. Berger), Academic Press, New York.Google Scholar
- Bechhofer, R.E. and D.Goldsman (1987b). "Truncat ion of the Bechhofer-Kie fer-Sobe 1 Procedure for Selecting the Normal Population which has the Largest Mean." To appear in Comm. Star. - B.Google Scholar
- Bechbofer,R.E.and D. Goldsman (1987c). "Tr uric at ion ofthe Bechhofer-K i e fer-Sobe 1 Procedure for Selecting the Normal Population which has the Largest Mean (II): 2-Factor Exper iments ~ithout Interact ion." Tech. Ileport, School of OR&IE, Cornell Univ., Ithaca, NY.Google Scholar
- Bechhofer, R.E., J. Kiefer, and M. Sobel (1968). Sequential Identification and Ranking Procedures. The Univ. of Chicago Press, Chicago.Google Scholar
- Fabian, V. (1974). "Note on Anderson's Sequential Procedures with Triangular Boundary," Annals of Statistics, 3, 170-175.Google ScholarCross Ref
- Gibbons, J.D., I. Olkin, and M. Sobel (1977). Selecting and Ordering Populations.John Wiley, New York. Google ScholarDigital Library
- Goldsman, D. (1986)."Tutorial on Indifference- Zon~Ranking and Seleer ion Procedures ." Proceedings of the 1986 Yinter Simulation Conference, 370-375. Google ScholarDigital Library
- Gupta, S.S. and S. Panchapakesan (1979). Hultiple Decision Procedures. John Wiley, New York.Google Scholar
- Paulson, E. (1984). "A Sequential Procedure for Selecting the Population with the Largest Mean from k Normal Populations." Ann. Math. Star., 35, 174-180.Google ScholarCross Ref
- Sullivan,D.W.and J.R.Wilson(1985). "Restricted Subset Select ion Procedures for Simulation.'~ Rsearch Mere. #85-15, School ofIE, Purdue Univ., W. Lafayette, Ind.Google Scholar
- Tamhane, A.C. and R.E. Bechhofer (1977). "A T~o- Stage Minimax Procedure with Screening for Selecting the Largest Normal Mean." Comm. Star. - Theor. ~eth., A6, 1003-1033.Google ScholarCross Ref
- Tamhane, A.C. and R.E. Bechhofer (1979). "A Two- St age Minimax Procedure with Screening for Selecting the Largest Normal Mean (iI): An Improved PCS Lower Bound and Associated Tables." Comm. Star. -Theor. ~eth., A8, 337-358.Google ScholarCross Ref
Index Terms
- Ranking and selection tutorial: 2-factor normal means procedures
Recommendations
Tutorial on indifference-zone normal means ranking and selection procedures
WSC '86: Proceedings of the 18th conference on Winter simulationThis tutorial concerns the ranking and selection problem of choosing that one of k normal populations (with common known variance) which has the largest mean. We discuss a number of procedures which guarantee a specified probability of selecting the ...
Recent advances in ranking and selection
WSC '07: Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to comeThis tutorial provides an overview on recent advances made in ranking and selection (R&S) for selecting the best simulated system and discusses challenges that still exist in the field. We focus on indifference-zone R&S procedures that provide a ...
Online kernel selection: algorithms and evaluations
AAAI'12: Proceedings of the Twenty-Sixth AAAI Conference on Artificial IntelligenceKernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being used, identifying good kernels among a set of given kernels is important ...
Comments