This paper considers the search problem, introduced by Srivastava cite{Sr}. This is a model discrimination problem. In the context of search linear models, discrimination ability of search designs has been studied by several researchers. Some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possible nonzero effect. In this paper, two criteria are proposed, based on Kullback-Leibler distance. These criteria are able to evaluate the search ability of designs, without any restriction on the number of nonzero effects.
Talebi, H., & Esmailzadeh, N. (2011). Using Kullback-Leibler distance for performance evaluation of search designs. Bulletin of the Iranian Mathematical Society, 37(No. 4), 269-279.
MLA
H. Talebi; N. Esmailzadeh. "Using Kullback-Leibler distance for performance evaluation of search designs". Bulletin of the Iranian Mathematical Society, 37, No. 4, 2011, 269-279.
HARVARD
Talebi, H., Esmailzadeh, N. (2011). 'Using Kullback-Leibler distance for performance evaluation of search designs', Bulletin of the Iranian Mathematical Society, 37(No. 4), pp. 269-279.
VANCOUVER
Talebi, H., Esmailzadeh, N. Using Kullback-Leibler distance for performance evaluation of search designs. Bulletin of the Iranian Mathematical Society, 2011; 37(No. 4): 269-279.
)