🔧На сайте запланированы технические работы
25.12.2025 в промежутке с 18:00 до 21:00 по Московскому времени (GMT+3) на сайте будут проводиться плановые технические работы. Возможны перебои с доступом к сайту. Приносим извинения за временные неудобства. Благодарим за понимание!
🔧Site maintenance is scheduled.
Scheduled maintenance will be performed on the site from 6:00 PM to 9:00 PM Moscow time (GMT+3) on December 25, 2025. Site access may be interrupted. We apologize for the inconvenience. Thank you for your understanding!

 

Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

In this paper we consider selection and ranking problems for the cases of binomial and Poisson populations. Our main goal is to construct lower bounds for the expected sample size of sequential selection and ranking procedures for the aforementioned problems in the setting of the indifference zone approach. Established lower bounds are investigated and their explicit estimates are obtained. After we investigate the efficiency of some sequential selection and ranking procedures with respect to our lower bounds.

作者简介

I. Kareev

Department of Mathematical Statistics

编辑信件的主要联系方式.
Email: kareevia@gmail.com
俄罗斯联邦, Kremlevskaya ul. 18, Kazan, 420008

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016