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

Iskander Kareev

Communications in Statistics - Theory and Methods, 2017, vol. 46, issue 19, 9787-9794

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2016.1222429 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:46:y:2017:i:19:p:9787-9794

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2016.1222429

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().