Abstract
Paul is trying to ascertain an unknown χ, out of n possibilities, from an adversary Carole by asking a series of q queries. In the standard “Twenty Questions” Paul wins if and only if n ≤ 2q. In Liar Games, Carole is allowed, under certain restrictions, to give an incorrect response. Throughout this study Carole will be restricted to give at most k incorrect responses, or lies. Asymptotic analysis here will be for k arbitrary but fixed, k = 1 being a natural and interesting case. The game with ten queries, one hundred possibilities, and (at most) one lie is amusing to play.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spencer, J. (2003). LIAR!. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_1
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive