Advertisement

A Comparative Study of Procedures for the Multinomial Selection Problem

  • Eric TollefsonEmail author
  • David Goldsman
  • Anton J. Kleywegt
  • Craig A. Tovey
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 200)

Abstract

This paper is concerned with the multinomial selection problem (MSP) originally formulated by Bechhofer, Elmaghraby, and Morse (1959). Over the past 50 years, numerous procedures have been developed for finding the most probable multinomial alternative; these procedures attempt to minimize the expected number of trials while exceeding a lower bound on the probability of making a correct selection when the multinomial probabilities satisfy an indifference-zone probability requirement. We examine such MSP procedures, including optimal procedures based on new linear and integer programming methods, provide more accurate and extensive parameter and performance tables for several procedures, and calculate and compare the exact efficiencies of the procedures.

Keywords

Multinomial selection problem Indifference zone Ranking and selection. 

References

  1. Alam, K., (1971). On selecting the most probable category. Technometrics 13, 843–850.CrossRefGoogle Scholar
  2. Bartholdi, J. J. (2010). The Great Package Race, The Supply Chain & Logistics Institute. Atlanta: Georgia Institute of Technology. www2.isye.gatech.edu/people/faculty/John_Barth-oldi/wh/package-race/package-race.html. Accessed 20 June 2012.Google Scholar
  3. Bechhofer, R. E., Elmaghraby, S., & Morse, N. (1959). A single-sample multiple decision procedure for selecting the multinomial event which has the highest probability. Annals of Mathematical Statistics 30, 102–119.CrossRefGoogle Scholar
  4. Bechhofer, R. E., & Goldsman, D. (1985a). On the Ramey-Alam sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics—Simulation and Computation B14, 263–282.CrossRefGoogle Scholar
  5. Bechhofer, R. E., & Goldsman, D. (1985b). Truncation of the Bechhofer-Kiefer-Sobel sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics—Simulation and Computation B14, 283–315.CrossRefGoogle Scholar
  6. Bechhofer, R. E., & Goldsman, D. (1986). Truncation of the Bechhofer-Kiefer-Sobel sequential procedure for selecting the multinomial event which has the largest probability (II): Extended tables and an improved procedure. Communications in Statistics—Simulation and Computation B15, 829–851.CrossRefGoogle Scholar
  7. Bechhofer, R. E., Kiefer, J., & Sobel, M. (1968). Sequential Identification and Ranking Procedures (with Special Reference to Koopman-Darmois Populations). University of Chicago Press: Chicago.Google Scholar
  8. Bechhofer, R. E., & Kulkarni, R. V. (1984). Closed sequential procedures for selecting the multinomial events which have the largest probabilities. Communications in Statistics—Theory and Methods A13, 2997–3031.Google Scholar
  9. Bechhofer, R. E., Santner, T. J., & Goldsman, D. (1995). Design and Analysis of Experiments for Statistical Selection, Screening and Multiple Comparisons. John Wiley and Sons: New York.Google Scholar
  10. Cacoullos, T., & Sobel, M. (1966). An inverse sampling procedure for selecting the most probable event in a multinomial distribution. In P. Krishnaiah (Ed.), Multivariate Analysis (pp. 423–455) New York: Academic Press.Google Scholar
  11. Chen, P. (1988). Closed inverse sampling procedure for selecting the largest multinomial cell probability. Communications in Statistics—Simulation and Computation B17, 969–994.CrossRefGoogle Scholar
  12. Chen, P. (1992). Truncated selection procedures for the most probable event and the least probable event. Annals of the Institute of Statistical Mathematics 44, 613–622.CrossRefGoogle Scholar
  13. Kesten, H., & Morse, N. (1959). A property of the multinomial distribution. Annals of Mathematical Statistics 30, 120–127.CrossRefGoogle Scholar
  14. Levin, B. (1984). On a sequential selection procedure of Bechhofer, Kiefer, and Sobel. Statistics Probability Letters 2, 91–94.CrossRefGoogle Scholar
  15. Ramey, J. T. Jr. & Alam, K. (1979). A sequential procedure for selecting the most probable multinomial event. Biometrika 66, 171–173.CrossRefGoogle Scholar
  16. Tollefson, E. (2012). Optimal Randomized and Non-Randomized Procedures for Multinomial Selection Problems, Ph.D. dissertation, H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.Google Scholar
  17. Tollefson, E., Goldsman, D., Kleywegt, A., & Tovey, C. (2013). Optimal selection of the most probable multinomial alternative. In review.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Eric Tollefson
    • 1
    Email author
  • David Goldsman
    • 1
  • Anton J. Kleywegt
    • 1
  • Craig A. Tovey
    • 1
  1. 1.H. Milton Stewart School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations