Skip to main content
    • Aa
    • Aa

Three Thresholds for a Liar

  • Joel Spencer (a1) and Peter Winkler (a2)

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

Hide All
[1] Aslam Javed and Dhagat Aditi. Searching in the presence of linearly bounded errors. In Proceedings of the 23rd Annual ACM Symposium of Theory of Computing, 1991.
[2] Berlekamp E.. Block Coding with Noiseless Feedback. PhD thesis, M.I.T., 1964.
[3] Feige U., Peleg D., Raghavan P., and Upfal E.. Computing with unreliable information. In Symposium on Theory of Computing, pages 128137, 1990.
[4] Frazier Michael. Searching with a non-constant number of lies. 1990.
[5] Hall Marshall. Combinatorial Theory (2nd ed.). Wiley, 1986.
[6] Kenyon Claire and Yao Andrew C.. On evaluation of boolean functions with unreliable tests. International Journal of Foundations of Computer Science, 1(1): 110, 1990.
[7] Pelc Andrzej. Solution of ulam's problem on searching with a lie. Journal of Combinatorial Theory, Ser. A, 44: 129140, 1987.
[8] Pelc Andrzej. Searching with known error probability. Theoretical Computer Science, 63: 185202, 1989.
[9] Rivest R. L., Meyer A. R., Kleitman D. J., Winklmann K., and Spencer J.. Coping with errors in binary search procedures. Journal of Computer and System Sciences, 20: 396404, 1980.
[10] Spencer Joel. Guess a number - with lying. Mathematics Magazine, 57(2): 105108, 1984.
[11] Spencer Joel. Balancing vectors in the max norm. Combinatorica, 6: 5565, 1986.
[12] Ulam S. M.. Adventures of a Mathematician. Charles Scribner's Sons, 1976.
[13] Lint J. H. van. Introduction to Coding Theory. Springer-Verlag, 1982.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 6 *
Loading metrics...

Abstract views

Total abstract views: 106 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st October 2017. This data will be updated every 24 hours.