Files
Abstract
We first propose two procedures for estimating the rejection probabilities of bootstrap tests in Monte Carlo experiments without actually computing a bootstrap test for each replication. These procedures are only about twice as expensive (per replication) as estimating rejection probabilities for asymptotic tests. We then propose a new procedure for computing bootstrap P values that will often be more accurate than ordinary ones. This “fast double bootstrap” is closely related to the double bootstrap, but it is far less computationally demanding. Simulation results for three different cases suggest that this procedure can be very useful in practice.