The k-in-a-row procedure in selection theory

Pinyuen Chen

doi:10.1007/BF02491471

The k-in-a-row procedure in selection theory

Pinyuen Chen

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

A k-in-a-row procedure is proposed to select the most demanded element in a set of n 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 that k-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.

Original language	English (US)
Pages (from-to)	325-330
Number of pages	6
Journal	Annals of the Institute of Statistical Mathematics
Volume	39
Issue number	1
DOIs	https://doi.org/10.1007/BF02491471
State	Published - Dec 1 1987

Keywords

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

ASJC Scopus subject areas

Statistics and Probability

Access to Document

10.1007/BF02491471

Fingerprint Dive into the research topics of 'The k-in-a-row procedure in selection theory'. Together they form a unique fingerprint.

Cite this

@article{da068999139f42fb992709edb707be9f,

title = "The k-in-a-row procedure in selection theory",

abstract = "A k-in-a-row procedure is proposed to select the most demanded element in a set of n 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 that k-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.",

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

author = "Pinyuen Chen",

year = "1987",

month = dec,

day = "1",

doi = "10.1007/BF02491471",

language = "English (US)",

volume = "39",

pages = "325--330",

journal = "Annals of the Institute of Statistical Mathematics",

issn = "0020-3157",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - The k-in-a-row procedure in selection theory

AU - Chen, Pinyuen

PY - 1987/12/1

Y1 - 1987/12/1

N2 - A k-in-a-row procedure is proposed to select the most demanded element in a set of n 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 that k-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.

AB - A k-in-a-row procedure is proposed to select the most demanded element in a set of n 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 that k-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.

KW - Fixed-sample sized procedure

KW - inverse sampling procedure

KW - k-in-a-row procedure

KW - least favorable configuration

KW - multinomial distribution

KW - ranking and selection

UR - http://www.scopus.com/inward/record.url?scp=51649148395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649148395&partnerID=8YFLogxK

U2 - 10.1007/BF02491471

DO - 10.1007/BF02491471

M3 - Article

AN - SCOPUS:51649148395

VL - 39

SP - 325

EP - 330

JO - Annals of the Institute of Statistical Mathematics

JF - Annals of the Institute of Statistical Mathematics

SN - 0020-3157

IS - 1

ER -