Resolvable designs with large blocks

• 成果类型: Article
• 署名作者: Morgan, J. P.; Reck, Brian H.
• 署名单位: Virginia Polytechnic Institute & State University; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
• 刊物名称: ANNALS OF STATISTICS
• ISSN/ISSBN: 0090-5364
• DOI: 10.1214/009053606000001253
• 发表日期: 2007
• 页码: 747-771
• 关键词: construction; EFFICIENCY; optimality; trials; list

摘要

Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and consequently given in terms of block concurrences. Equalizing block concurrences for given block sizes is often, but not always, the best strategy. Sufficient conditions are established for various strong optimalities and a detailed study of E-optimality is offered, including a characterization of the E-optimal class. Optimal designs are found to correspond to balanced arrays and an affine-like generalization.