The two-batch liar game over an arbitrary channel

Ioana Dumitriu, Joel Spencer

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)1056-1064
Number of pages9
JournalSIAM Journal on Discrete Mathematics
Issue number4
StatePublished - 2005


  • Adaptive strategy
  • Asymptotics
  • Channel
  • Coding theory
  • Liar games

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'The two-batch liar game over an arbitrary channel'. Together they form a unique fingerprint.

Cite this