skip to main content
10.1145/318123.318230acmconferencesArticle/Chapter ViewAbstractPublication PageswscConference Proceedingsconference-collections
Article
Free Access

On selecting the best of k systems: an expository survey of subset-selection multinomial procedures

Published:01 December 1988Publication History

ABSTRACT

This paper studies the subset-selection approach of the ranking and selection procedures of choosing among k arbitrary systems or alternatives. Ranking and selection problems have customarily been treated using two different approaches, namely, the indifference-zone approach and the subset-selection approach. An expository survey of indifference-zone approach for selecting the best of k systems has been given in Goldsman (1984a). In this paper, we present a number of fixed-sample-size and sequential procedures based on subset-selection approach.

References

  1. Bechhofer, R.E. and Chen, p. (1987). A curtailed sequential procedure for subset selection of multinomial cells. Technical Report No. S-42, Department of Mathematics, Syracuse University, Syracuse, NY.Google ScholarGoogle Scholar
  2. Bechhofer, R.E. and Goldsman, D.M. (1985). Truncation of the Bechhofer-Diefer-Sobel sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics-- Simulation and Computation. BI_44 (2), 283-315.Google ScholarGoogle Scholar
  3. Bechhofer, R.E. and Goldsman, D.M. (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. BI_55 (3), 829-851.Google ScholarGoogle Scholar
  4. Chen, P. (1986). Inverse sampling subset selection for multinomial distribution. American Journal of Mathematical and Management Sciences, Vol. 6, Nos. 1 and 2, 41-64.Google ScholarGoogle Scholar
  5. Chen, P. (1987). Truncated inverse sampling procedure for multinomial subset selection. Tech. Report No. S-41, Department of Mathematics, Syracuse University, Syracuse, N.Y.Google ScholarGoogle Scholar
  6. Gibbons, J.D., Olkin, I., and Sobel, M. (1977). Selecting and ordering populations: a new statistical methodolo~y. Wiley, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Goldsman, D.M. (1984a). On selecting the best of K systems: An expository survey of indifference-zone multinomial procedures. Proceedings of the 1984 Winter Simulation Conference, i 07 - i 12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Goldsman, D.M. (1984b). A multinomial ranking and selection procedure: Simulation and Applications. Proceedings of the 1984 Winter Simulation Conference, 259-264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Gupta, S.S. and Nagel, K. (1967). On selection and ran~:ing procedures and order statistics from the multinomial distribution. Sankhy~{ , Ser. B, 29, 1-34.Google ScholarGoogle Scholar
  10. Gupta, S.S. and Panchapakesan, S. (1979) . Multiple decision procedures. Wiley, New York.Google ScholarGoogle Scholar
  11. Panchapakesan, S. (1971). On a subset selection procedu~ce for the most probable event in a multinomial distribution. Statistical Decision Theor~f and Related Topics. (Eds. S. S. Gupta and J. Yackel), Academic Press, New York, 275-298.Google ScholarGoogle Scholar

Index Terms

  1. On selecting the best of k systems: an expository survey of subset-selection multinomial procedures

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        WSC '88: Proceedings of the 20th conference on Winter simulation
        December 1988
        896 pages
        ISBN:0911801421
        DOI:10.1145/318123

        Copyright © 1988 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 December 1988

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate3,413of5,075submissions,67%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader