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

Leon Pesotchinsky

Statistics & Probability Letters, 1982, vol. 1, issue 1, 41-45

Abstract: The problems considered in this paper are similar to those studied by Arrow, Pesotchinsky and Sobel (1981). We search for the optimal methods of ordering of a sample or of identifying sample order statistics by asking binary type questions and employing the criterion which defines the cost of a question as the number of responses. The asymptotic results show that our procedures with simple algorithms are comparable (in terms of cost) with the best known methods for ordering by using pairwise comparisons.

Keywords: Complete; ordering; median; optimal; sequential; search; order; statistics; pairwise; comparisons (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0167-7152(82)90012-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:1:y:1982:i:1:p:41-45

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 ().