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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
