Truth tellers and liars with fewer questions

Gilad Braunschvig, Alon Brutzkus, David Peleg*, Adam Sealfon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study the problem of using binary questions to identify a single truth teller from a collection of p players, at most ℓ of whom may lie. Our focus is on trying to solve the problem using ℓ (or slightly more than ℓ) questions, which is the fewest feasible number of questions.

Original languageEnglish
Pages (from-to)1310-1316
Number of pages7
JournalDiscrete Mathematics
Issue number8
StatePublished - 6 Aug 2015
Externally publishedYes


  • Knights and knaves
  • Searching with errors


Dive into the research topics of 'Truth tellers and liars with fewer questions'. Together they form a unique fingerprint.

Cite this