Efficiency of connected binary block designs when a single observation is unavailable |
| |
Authors: | Subir Ghosh Sanpei Kageyama Rahul Mukerjee |
| |
Affiliation: | (1) Department of Statistics, University of California, 92521-0138 Riverside, CA, U.S.A.;(2) Mathematics Education, Faculty of School Education, Hiroshima University, Minami-ku, 734 Hiroshima, Japan;(3) Joka, Indian Institute of Management, Diamond Harbour Road, Post Box No. 16757 Alipore Post Office, 700027 Calcutta, India |
| |
Abstract: | In this paper the problem of finding the design efficiency is considered when a single observation is unavailable in a connected binary block design. The explicit expression of efficiency is found for the resulting design when the original design is a balanced incomplete block design or a group divisible, singular or semiregular or regular with 1>0, design. The efficiency does not depend on the position of the unavailable observation. For a regular group divisible design with 1>0, the efficiency depends on the position of the unavailable observation. The bounds, both lower and upper, on the efficiency are given in this situation. The efficiencies of designs resulting from a balanced incomplete block design and a group divisible design are in fact high when a single observation is unavailable.The work of the first author is sponsored by the Air Force Office of Scientific Research under Grant AFOSR-90-0092.On leave from Indian Statistical Institute, Calcutta, India. The work of the third author was supported by a grant from the CMDS, Indian Institute of Management, Calcutta. |
| |
Keywords: | Balanced incomplete block design connectedness efficiency group divisible design robustness |
本文献已被 SpringerLink 等数据库收录! |
|