We consider an exact sequential conditional test for three-way conditional test of no interaction. At each time τ, the test uses as the conditional inference frame the set F(Hτ) of all tables with... Show moreWe consider an exact sequential conditional test for three-way conditional test of no interaction. At each time τ, the test uses as the conditional inference frame the set F(Hτ) of all tables with the same three two-way marginal tables as the obtained table Hτ . For 3 × 3 × K tables, we propose a method to construct F(Hτ) from F(Hτ−1). This enables us to perform efficiently the sequential exact conditional test. The subset Sτ of F (Hτ ) consisting of s + Hτ − Hτ −1 for s ∈ F(Hτ−1) contains Hτ , where the operations + and − are defined elementwise. Our argument is based on the minimal Markov basis for 3 × 3 × K contingency tables and we give a minimal subset M of some Markov basis which has the property that F (Hτ ) = {s − m | s ∈ Sτ , m ∈ M}. Show less
