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

DOI10.1016/0167-7152(84)90003-8zbMath0543.62015OpenAlexW1970274420MaRDI QIDQ796195

Leon Pesotchinsky

Publication date: 1984

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

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

zbMATH Keywords

robustnessasymptotic resultsleast favorable configurationcomplete orderingprobability of correct selectionbinary-type questionspairwise comparison proceduressearch for the largest

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15)

Cites Work

• Unnamed Item
• Expected cost bounds for the selection and ordering procedures based on binary-type questions
• On Partitioning a Sample With Binary-Type Questions in Lieu of Collecting Observations

This page was built for publication: Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons