Skip to main content
SpringerLink
Log in

Thek-in-a-row procedure in selection theory

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alam, K. and Thompson, J. R. (1971). On selecting the least probable multinomial event,Ann. Math. Statist.,43, 1983–1990.

    MathSciNet  MATH  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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. Chen, P. (1985). Subset selection for the least probable multinomial cell,Ann. Inst. Statist. Math.,37, 303–314.

    Article  MathSciNet  Google Scholar 

  5. Feller, W. (1957).An Introduction to Probability Theory and Its Applications, Wiley, New York.

    MATH  Google Scholar 

  6. Kan, Y. C. and Ross, S. M. (1980). Optimal list order under partial memory constraints,J. Appl. Prob.,17, 1004–1015.

    Article  MathSciNet  Google Scholar 

  7. Ross, S. M. (1985).Introduction to Probability Models, 3rd ed., Academic Press, Orlando, Florida.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Syracuse University, Syracuse, USA

    Pinyuen Chen

Authors
  1. Pinyuen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Chen, P. Thek-in-a-row procedure in selection theory. Ann Inst Stat Math 39, 325–330 (1987). https://doi.org/10.1007/BF02491471

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02491471

Key words and phrases

Search

Navigation