Three Thresholds for a Liar

Joel Spencer, Peter Winkler

Research output: Contribution to journalArticle

Abstract

Motivated by the problem of making correct computations from partly false information, we study a corruption of the classic game “Twenty Questions” in which the player who answers the yes-or-no questions is permitted to lie up to a fixed fraction r of the time. The other player is allowed q arbitrary questions with which to try to determine, with certainty, which of n objects his opponent has in mind; he “wins” if he can always do so, and “wins quickly” if he can do so using only O(log n) questions. It turns out that there is a threshold value for r below which the querier can win quickly, and above which he cannot win at all. However, the threshold value varies according to the precise rules of the game. Our “three thresholds theorem” says that when the answerer is forbidden at any point to have answered more than a fraction r of the questions incorrectly, then the threshold value is r = ½; when the requirement is merely that the total number of lies cannot exceed rq, the threshold is ⅓; and finally if the answerer gets to see all the questions before answering, the threshold drops to ¼.

Original language English (US) 81-93 13 Combinatorics Probability and Computing 1 1 https://doi.org/10.1017/S0963548300000080 Published - 1992

Threshold Value
Game
Exceed
Vary
Requirements
Arbitrary
Theorem

ASJC Scopus subject areas

• Applied Mathematics
• Theoretical Computer Science
• Statistics and Probability
• Computational Theory and Mathematics

Cite this

Three Thresholds for a Liar. / Spencer, Joel; Winkler, Peter.

In: Combinatorics Probability and Computing, Vol. 1, No. 1, 1992, p. 81-93.

Research output: Contribution to journalArticle

Spencer, Joel ; Winkler, Peter. / Three Thresholds for a Liar. In: Combinatorics Probability and Computing. 1992 ; Vol. 1, No. 1. pp. 81-93.
@article{6a14af75111849ffa033531d8e38edf8,
title = "Three Thresholds for a Liar",
abstract = "Motivated by the problem of making correct computations from partly false information, we study a corruption of the classic game “Twenty Questions” in which the player who answers the yes-or-no questions is permitted to lie up to a fixed fraction r of the time. The other player is allowed q arbitrary questions with which to try to determine, with certainty, which of n objects his opponent has in mind; he “wins” if he can always do so, and “wins quickly” if he can do so using only O(log n) questions. It turns out that there is a threshold value for r below which the querier can win quickly, and above which he cannot win at all. However, the threshold value varies according to the precise rules of the game. Our “three thresholds theorem” says that when the answerer is forbidden at any point to have answered more than a fraction r of the questions incorrectly, then the threshold value is r = ½; when the requirement is merely that the total number of lies cannot exceed rq, the threshold is ⅓; and finally if the answerer gets to see all the questions before answering, the threshold drops to ¼.",
author = "Joel Spencer and Peter Winkler",
year = "1992",
doi = "10.1017/S0963548300000080",
language = "English (US)",
volume = "1",
pages = "81--93",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - Three Thresholds for a Liar

AU - Spencer, Joel

AU - Winkler, Peter

PY - 1992

Y1 - 1992

N2 - Motivated by the problem of making correct computations from partly false information, we study a corruption of the classic game “Twenty Questions” in which the player who answers the yes-or-no questions is permitted to lie up to a fixed fraction r of the time. The other player is allowed q arbitrary questions with which to try to determine, with certainty, which of n objects his opponent has in mind; he “wins” if he can always do so, and “wins quickly” if he can do so using only O(log n) questions. It turns out that there is a threshold value for r below which the querier can win quickly, and above which he cannot win at all. However, the threshold value varies according to the precise rules of the game. Our “three thresholds theorem” says that when the answerer is forbidden at any point to have answered more than a fraction r of the questions incorrectly, then the threshold value is r = ½; when the requirement is merely that the total number of lies cannot exceed rq, the threshold is ⅓; and finally if the answerer gets to see all the questions before answering, the threshold drops to ¼.

AB - Motivated by the problem of making correct computations from partly false information, we study a corruption of the classic game “Twenty Questions” in which the player who answers the yes-or-no questions is permitted to lie up to a fixed fraction r of the time. The other player is allowed q arbitrary questions with which to try to determine, with certainty, which of n objects his opponent has in mind; he “wins” if he can always do so, and “wins quickly” if he can do so using only O(log n) questions. It turns out that there is a threshold value for r below which the querier can win quickly, and above which he cannot win at all. However, the threshold value varies according to the precise rules of the game. Our “three thresholds theorem” says that when the answerer is forbidden at any point to have answered more than a fraction r of the questions incorrectly, then the threshold value is r = ½; when the requirement is merely that the total number of lies cannot exceed rq, the threshold is ⅓; and finally if the answerer gets to see all the questions before answering, the threshold drops to ¼.

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

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

U2 - 10.1017/S0963548300000080

DO - 10.1017/S0963548300000080

M3 - Article

AN - SCOPUS:0002915459

VL - 1

SP - 81

EP - 93

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1

ER -