Kazan Federal University Digital Repository

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

Show simple item record

dc.contributor.author Kareev I.
dc.date.accessioned 2018-09-19T22:10:06Z
dc.date.available 2018-09-19T22:10:06Z
dc.date.issued 2016
dc.identifier.issn 1995-0802
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/144797
dc.description.abstract © 2016, Pleiades Publishing, Ltd.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.
dc.relation.ispartofseries Lobachevskii Journal of Mathematics
dc.subject binomial populations
dc.subject efficiency
dc.subject expected sample size
dc.subject indifference zone
dc.subject lower bounds for expected sample size
dc.subject Poisson populations
dc.subject ranking
dc.subject Selection
dc.title Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations
dc.type Article
dc.relation.ispartofseries-issue 4
dc.relation.ispartofseries-volume 37
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 455
dc.source.id SCOPUS19950802-2016-37-4-SID84978492399


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics