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

A general minimum lower-order confounding criterion for s-level blocked designs

Author

Listed:
  • Zhi Li
  • Zhi-Ming Li

Abstract

Blocked designs are widely used in practical experiments with heterogeneous experimental units. The blocked general minimum lower-order confounding (B1-GMC) criterion is appropriate for selecting optimal blocked designs. This article extends B1-GMC criterion to s-level blocked designs. First, we introduce a blocked aliased component-number pattern (B1-ACNP) to reflect the confounding information among various component effects s. Further, the existing optimal criteria can be expressed by some functions of elements in the B1-ACNP. Finally, we not only give the formulas of lower-order confounding information by the complementary method, but also provide an algorithm to calculate the lower-order confounding in blocked designs. Some examples are given to illustrate our theoretical results.

Suggested Citation

  • Zhi Li & Zhi-Ming Li, 2025. "A general minimum lower-order confounding criterion for s-level blocked designs," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(5), pages 1410-1426, March.
    • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:5:p:1410-1426
    DOI: 10.1080/03610926.2024.2340598
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2340598
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2024.2340598?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:54:y:2025:i:5:p:1410-1426. 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.