Lower bound for the average sample size and the efficiency of ranking sequential procedures for the sequential selection procedures have been obtained in [
I. A.
Kareev, Theory Probab. Appl., 57 (2013), pp. 227
Lower bound for the average sample size and the efficiency of ranking sequential procedures for the sequential selection procedures have been obtained in [
I. A.
Kareev, Theory Probab. Appl., 57 (2013), pp. 227
Lower bounds for average sample size and efficiency of sequential selection procedures is guaranteed. In construction of bounds we use universal bounds of Volodin and Malyutov [
I. N. Volodin, Theory