Efficiency of connected binary block designs when a single observation is unavailable

Ghosh, Subir ; Kageyama, Sanpei ; Mukerjee, Rahul (1992) Efficiency of connected binary block designs when a single observation is unavailable Annals of the Institute of Statistical Mathematics, 44 (3). pp. 593-603. ISSN 0020-3157

Full text not available from this repository.

Official URL: http://www.springerlink.com/content/t6642724455625...

Related URL: http://dx.doi.org/10.1007/BF00050708

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.

Item Type:Article
Source:Copyright of this article belongs to Springer-Verlag.
Keywords:Balanced Incomplete Block Design; Connectedness; Efficiency; Group Divisible Design; Robustness
ID Code:20293
Deposited On:20 Nov 2010 14:43
Last Modified:02 Mar 2011 08:51

Repository Staff Only: item control page