Truth tellers and liars with fewer questions

Gilad Braunschvig; Alon Brutzkus; David Peleg; Adam Sealfon

doi:10.1016/j.disc.2015.01.017

Truth tellers and liars with fewer questions

Gilad Braunschvig, Alon Brutzkus, David Peleg, Adam Sealfon

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/j.disc.2015.01.017
State	Published - 6 Aug 2015
Externally published	Yes

Bibliographical note

Funding Information:
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 .

Publisher Copyright:
© 2015 Published by Elsevier B.V.

Keywords

Knights and knaves
Searching with errors

Access to Document

10.1016/j.disc.2015.01.017

Cite this

@article{865ecabfce2643d3941366db8a0717fd,

title = "Truth tellers and liars with fewer questions",

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.",

keywords = "Knights and knaves, Searching with errors",

author = "Gilad Braunschvig and Alon Brutzkus and David Peleg and Adam Sealfon",

note = "Publisher Copyright: {\textcopyright} 2015 Published by Elsevier B.V.",

year = "2015",

month = aug,

day = "6",

doi = "10.1016/j.disc.2015.01.017",

language = "אנגלית",

volume = "338",

pages = "1310--1316",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

T1 - Truth tellers and liars with fewer questions

AU - Braunschvig, Gilad

AU - Brutzkus, Alon

AU - Peleg, David

AU - Sealfon, Adam

PY - 2015/8/6

Y1 - 2015/8/6

N2 - 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.

AB - 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.

KW - Knights and knaves

KW - Searching with errors

UR - http://www.scopus.com/inward/record.url?scp=84925059222&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2015.01.017

DO - 10.1016/j.disc.2015.01.017

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84925059222

SN - 0012-365X

VL - 338

SP - 1310

EP - 1316

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

ER -

Truth tellers and liars with fewer questions

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this