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

Multiple comparison procedures for finding non-maximum normal means

Author

Listed:
  • Tsunehisa Imada

Abstract

In this study, we discuss multiple comparison procedures for finding normal means which are not maximum among several normal means. Specifically, we propose the single step procedure, the sequentially rejective step down procedure and the step up procedure. For the single step procedure we determine the critical value for a specified significance level. For the sequentially rejective step down procedure and the step up procedure we determine the critical value at each step of the test for a specified significance level. For three procedures we formulate the power of the test under a specified alternative hypothesis. We give some numerical examples regarding critical values and power of the test intended to compare three procedures.

Suggested Citation

  • Tsunehisa Imada, 2020. "Multiple comparison procedures for finding non-maximum normal means," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(16), pages 4073-4090, August.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:16:p:4073-4090
    DOI: 10.1080/03610926.2019.1595652
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1595652
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2019.1595652?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:16:p:4073-4090. 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.