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

Leon Pesotchinsky

Statistics & Probability Letters, 1984, vol. 2, issue 3, 133-138

Abstract: This paper continues the comparative study of ordering and selection procedures based on binary-type questions vs. standard methods based on pairwise comparisons. We are interested in the robustness of the procedures against minor errors in the compared values. This is formulated in terms of the probability of a correct selection, P(CS). The asymptotic results indicate that under certain conditions both types of the procedure provide for the P(CS) values close to 1, and that the P(CS) values for the procedures based on binary-type questions are generally larger than P(CS) values for the pairwise comparison procedures.

Keywords: complete; ordering; binary-type; questions; least; favorable; configuration; probability; of; a; correct; selection; pairwise; comparisons; search; for; the; largest (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0167-7152(84)90003-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:2:y:1984:i:3:p:133-138

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().