IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v1y1982i1p41-45.html
   My bibliography  Save this article

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

Author

Listed:
  • Pesotchinsky, Leon

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.

Suggested Citation

  • Pesotchinsky, Leon, 1982. "Expected cost bounds for the selection and ordering procedures based on binary-type questions," Statistics & Probability Letters, Elsevier, vol. 1(1), pages 41-45, July.
    • Handle: RePEc:eee:stapro:v:1:y:1982:i:1:p:41-45
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0167-7152(82)90012-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:1:y:1982:i:1:p:41-45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.