Article ID: | iaor20126823 |
Volume: | 24 |
Issue: | 4 |
Start Page Number: | 624 |
End Page Number: | 635 |
Publication Date: | Sep 2012 |
Journal: | INFORMS Journal on Computing |
Authors: | Singham Dashi I, Schruben Lee W |
Keywords: | combinatorial optimization, simulation: applications |
Absolute precision stopping rules are often used to determine the length of sequential experiments to estimate confidence intervals for simulated performance measures. Much is known about the asymptotic behavior of such procedures. In this paper, we introduce coverage contours to quantify the trade‐offs in interval coverage, stopping times, and precision for finite‐sample experiments using absolute precision rules. We use these contours to evaluate the coverage of a basic absolute precision stopping rule, and we show that this rule will lead to a bias in coverage even if all of the assumptions supporting the procedure are true. We define optimal stopping rules that deliver nominal coverage with the smallest expected number of observations. Contrary to previous asymptotic results that suggest decreasing the precision of the rule to approach nominal coverage in the limit, we find that it is optimal to increase the confidence coefficient used in the stopping rule, thus obtaining nominal coverage in a finite‐sample experiment. If the simulation data are independent and identically normally distributed, we can calculate coverage contours analytically and find a stopping rule that is insensitive to the variance of the data while delivering at least nominal coverage for any precision value.