A computational approach to the Kiefer-Weiss problem for sampling from a Bernoulli population
DOI10.1080/07474946.2022.2070212zbMath1493.62484arXiv2110.04802OpenAlexW3206201245MaRDI QIDQ5089390
No author found.
Publication date: 19 July 2022
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04802
optimal stoppinghypothesis testingBernoulli trialssequential analysisoptimal sequential testsKiefer-Weiss problem
Parametric hypothesis testing (62F03) Stopping times; optimal stopping problems; gambling theory (60G40) Sequential statistical analysis (62L10) Optimal stopping in statistics (62L15) Markov processes: hypothesis testing (62M02)
Related Items (2)
Cites Work
- An efficient approximate solution to the Kiefer-Weiss problem
- 2-SPRT's and the modified Kiefer-Weiss problem of minimizing an expected sample size
- Optimal stopping and sequential tests which minimize the maximum expected sample size
- Some Properties of Generalized Sequential Probability Ratio Tests
- Optimal Sequential Tests for Two Simple Hypotheses
- Structure of sequential tests minimizing an expected sample size
- Remark on the modified kiefeer-weiss problem for exponntial families
- Operating Characteristic and Average Sample Number of Binary and Multi-Hypothesis Sequential Probability Ratio Test
- Computation of Some Exact Properties of Wald's Sprt when Sampling from a Class of Discrete Distributions
- Sequential hypothesis tests under random horizon
- The optimal decision rule in the Kiefer-Weiss problem for a Brownian motion
- On Sequential Tests Which Minimize the Maximum Expected Sample Size
- Sampling Plans Which Approximately Minimize the Maximum Expected Sample Size
- Optimum Character of the Sequential Probability Ratio Test
This page was built for publication: A computational approach to the Kiefer-Weiss problem for sampling from a Bernoulli population
