IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i1p243-256.html
   My bibliography  Save this article

Bounds on the efficiency of unbalanced ranked-set sampling

Author

Listed:
  • Jesse Frey

Abstract

Takahasi and Wakimoto (1968) derived a sharp upper bound on the efficiency of the balanced ranked-set sampling (RSS) sample mean relative to the simple random sampling (SRS) sample mean under perfect rankings. The bound depends on the set size and is achieved for uniform distributions. Here we generalize the Takahasi and Wakimoto (1968) result by finding a sharp upper bound in the case of unbalanced RSS. The bound depends on the particular unbalanced design, and the distributions where the bound is achieved can be highly nonuniform. The bound under perfect rankings can be exceeded under imperfect rankings.

Suggested Citation

  • Jesse Frey, 2020. "Bounds on the efficiency of unbalanced ranked-set sampling," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(1), pages 243-256, January.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:1:p:243-256
    DOI: 10.1080/03610926.2018.1543769
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2018.1543769
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2018.1543769?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:49:y:2020:i:1:p:243-256. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.