Advertisement

Thek-in-a-row procedure in selection theory

  • Pinyuen Chen
Article
  • 12 Downloads

Summary

Ak-in-a-row procedure is proposed to select the most demanded element in a set ofn elements. We show that the least favorable configuration of the proposed procedure which always selects the element when the same element has been demanded (or observed)k times in a row has a simple form similar to those of classical selection procedures. Moreover, numerical evidences are provided to illustrate the fact thatk-in-a-row procedure is better than the usual inverse sampling procedure and fixed sample size procedure when the distance between the most demanded element and the other elements is large and when the number of elements is small.

Key words and phrases

Fixed-sample sized procedure inverse sampling procedure k-in-a-row procedure least favorable configuration multinomial distribution ranking and selection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Alam, K. and Thompson, J. R. (1971). On selecting the least probable multinomial event,Ann. Math. Statist.,43, 1983–1990.MathSciNetMATHGoogle Scholar
  2. [2]
    Bechhofer, R. E., Elmaghraby, S. and Morse, N. (1959). A single-sample multiple-decision procedure for selecting the multinomial event which has the highest probability,Ann. Math. Statist. 30, 102–119.MathSciNetCrossRefGoogle Scholar
  3. [3]
    Cacoullos, T. and Sobel, M. (1966). An inverse-sampling procedure for selecting the most probable event in a multinomial distribution,Proc. 1st Internat. Symp. Multivariate Anal. (ed. P. R. Krishnaiah), Academic Press, New York, 423–455.Google Scholar
  4. [4]
    Chen, P. (1985). Subset selection for the least probable multinomial cell,Ann. Inst. Statist. Math.,37, 303–314.MathSciNetCrossRefGoogle Scholar
  5. [5]
    Feller, W. (1957).An Introduction to Probability Theory and Its Applications, Wiley, New York.MATHGoogle Scholar
  6. [6]
    Kan, Y. C. and Ross, S. M. (1980). Optimal list order under partial memory constraints,J. Appl. Prob.,17, 1004–1015.MathSciNetCrossRefGoogle Scholar
  7. [7]
    Ross, S. M. (1985).Introduction to Probability Models, 3rd ed., Academic Press, Orlando, Florida.MATHGoogle Scholar

Copyright information

© The Institute of Statistical Mathematics, Tokyo 1987

Authors and Affiliations

  • Pinyuen Chen
    • 1
  1. 1.Syracuse UniversitySyracuseUSA

Personalised recommendations