Scholion.ai

On Inverting Permutation Tests

David Tritchler

Journal of the American Statistical Association · 1984 · Volume 79 · Issue 385

DOI: 10.1080/01621459.1984.10477085

Abstract

Polynomial time algorithms are presented for inverting permutation tests. The one-sample permutation test is inverted to make confidence statements about a location parameter, and the two-sample permutation test is inverted to make confidence statements concerning a shift in location or scale. These algorithms require polynomial time, as opposed to complete enumeration algorithms, which require exponential time. A computational method for the inversion of rank tests is also suggested. The algorithms extend to stratified experiments.

Enable JavaScript for citation tools and additional paper interactions.