The Two-Batch Liar Game over an Arbitrary Channel
Ioana Dumitriu, Joel Spencer · SIAM Journal on Discrete Mathematics · 2005
We consider liar games in which player Paul must ask one full batch of questions, receive all answers, and then ask a second and final batch of questions. We show that the effect of this restriction is asymptotically negligible. The strategy for Paul is given explicitly.