Lower bounds for average sample size and efficiency of sequential ranking procedures
Teoriâ veroâtnostej i ee primeneniâ, Tome 58 (2013) no. 3, pp. 591-597

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{TVP_2013_58_3_a9,
     author = {I. A. Kareev},
     title = {Lower bounds for average sample size and efficiency of sequential ranking procedures},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {591--597},
     publisher = {mathdoc},
     volume = {58},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_2013_58_3_a9/}
}
TY  - JOUR
AU  - I. A. Kareev
TI  - Lower bounds for average sample size and efficiency of sequential ranking procedures
JO  - Teoriâ veroâtnostej i ee primeneniâ
PY  - 2013
SP  - 591
EP  - 597
VL  - 58
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TVP_2013_58_3_a9/
LA  - ru
ID  - TVP_2013_58_3_a9
ER  - 
%0 Journal Article
%A I. A. Kareev
%T Lower bounds for average sample size and efficiency of sequential ranking procedures
%J Teoriâ veroâtnostej i ee primeneniâ
%D 2013
%P 591-597
%V 58
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TVP_2013_58_3_a9/
%G ru
%F TVP_2013_58_3_a9
I. A. Kareev. Lower bounds for average sample size and efficiency of sequential ranking procedures. Teoriâ veroâtnostej i ee primeneniâ, Tome 58 (2013) no. 3, pp. 591-597. http://geodesic.mathdoc.fr/item/TVP_2013_58_3_a9/