Lower bounds for expected sample size of sequential procedures for the multinomial selection problems

dc.contributor.author	Kareev I.
dc.date.accessioned	2018-04-05T07:09:20Z
dc.date.available	2018-04-05T07:09:20Z
dc.date.issued	2017
dc.identifier.issn	0361-0926
dc.identifier.uri	http://dspace.kpfu.ru/xmlui/handle/net/129669
dc.description.abstract	© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size of sequential selection procedures are constructed for the problem of selecting the most probable event of k-variate multinomial distribution. The study is based on Volodin’s universal lower bounds for expected sample size of statistical inference procedures. The obtained lower bounds are used to estimate the efficiency of some selection procedures in terms of their expected sample sizes.
dc.relation.ispartofseries	Communications in Statistics - Theory and Methods
dc.subject	Efficiency
dc.subject	Expected sample size
dc.subject	Indifference zone
dc.subject	Lower bound
dc.subject	Multinomial selection
dc.subject	Sequential procedure
dc.title	Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
dc.type	Article
dc.relation.ispartofseries-issue	19
dc.relation.ispartofseries-volume	46
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	9787
dc.source.id	SCOPUS03610926-2017-46-19-SID85021208579

Файлы в этом документе

Размер: 47.51Kb

Формат: PDF

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