TY - JOUR
T1 - Truth tellers and liars with fewer questions
AU - Braunschvig, Gilad
AU - Brutzkus, Alon
AU - Peleg, David
AU - Sealfon, Adam
N1 - Publisher Copyright:
© 2015 Published by Elsevier B.V.
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 -