Abstract
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 language | English |
|---|---|
| Pages (from-to) | 1310-1316 |
| Number of pages | 7 |
| Journal | Discrete Mathematics |
| Volume | 338 |
| Issue number | 8 |
| DOIs | |
| State | Published - 6 Aug 2015 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2015 Published by Elsevier B.V.
Funding
The authors are grateful to John Howard for introducing them to the problem, to Eylon Yogev and Yoav Ben-Shalom for helpful discussions, and to the anonymous referee for helpful comments. Research of the second author was supported by the Kupcinet-Getz Summer Science School at the Weizmann Institute . Research of the third author was supported by the Israel Science Foundation (grant 894/09 ), the I-CORE program of the Israel PBC and ISF (grant 4/11 ), the United States-Israel Binational Science Foundation (grant 2008348 ), the Israel Ministry of Science and Technology (infrastructures grant), and the Citi Foundation . Research of fourth author was supported by the Kupcinet-Getz International Summer Science School at the Weizmann Institute .
| Funders | Funder number |
|---|---|
| Israel PBC | |
| Kupcinet-Getz International Summer Science School | |
| Kupcinet-Getz Summer Science School | |
| Citi Foundation | |
| United States-Israel Binational Science Foundation | 2008348 |
| Israel Science Foundation | 4/11, 894/09 |
| Israeli Centers for Research Excellence | |
| Ministry of science and technology, Israel |
Keywords
- Knights and knaves
- Searching with errors