A computational approach to the Kiefer-Weiss problem for sampling from a Bernoulli population
Abstract
We present a computational approach to solution of the Kiefer-Weiss problem. Algorithms for construction of the optimal sampling plans and evaluation of their performance are proposed. In the particular case of Bernoulli observations, the proposed algorithms are implemented in the form of R program code. Using the developed computer program, we numerically compare the optimal tests with the respective sequential probability ratio test (SPRT) and the fixed sample size test, for a wide range of hypothesized values and type I and type II errors. The results are compared with those of D.~Freeman and L.~Weiss (Journal of the American Statistical Association, 59(1964)). The R source code for the algorithms of construction of optimal sampling plans and evaluation of their characteristics is available at https://github.com/tosinabase/Kiefer-Weiss.
Cite
@article{arxiv.2110.04802,
title = {A computational approach to the Kiefer-Weiss problem for sampling from a Bernoulli population},
author = {Andrey Novikov and Andrei Novikov and Fahil Farkhshatov},
journal= {arXiv preprint arXiv:2110.04802},
year = {2021}
}
Comments
23 pages, 5 Tables, 3 Figures