Thek-in-a-row procedure in selection theory
- 12 Downloads
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 phrasesFixed-sample sized procedure inverse sampling procedure k-in-a-row procedure least favorable configuration multinomial distribution ranking and selection
Unable to display preview. Download preview PDF.
- 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
- Feller, W. (1957).An Introduction to Probability Theory and Its Applications, Wiley, New York.Google Scholar
- Ross, S. M. (1985).Introduction to Probability Models, 3rd ed., Academic Press, Orlando, Florida.Google Scholar