Expected cost bounds for the selection and ordering procedures based on binary-type questions

DOI10.1016/0167-7152(82)90012-8zbMath0493.62070OpenAlexW2039749872MaRDI QIDQ1168674

Leon Pesotchinsky

Publication date: 1982

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(82)90012-8

zbMATH Keywords

medianpairwise comparisonscomplete orderingbinary-type questionsoptimal sequential searchexpected cost boundsidentifying sample order statistics

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Sequential statistical methods (62L99) Sequential statistical analysis (62L10) Statistical ranking and selection procedures (62F07) Probabilistic methods, stochastic differential equations (65C99)

Related Items (1)

Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons

Cites Work

• Unnamed Item
• On Partitioning a Sample With Binary-Type Questions in Lieu of Collecting Observations
• Expected time bounds for selection

This page was built for publication: Expected cost bounds for the selection and ordering procedures based on binary-type questions