The Liar Game Over an Arbitrary Channel

Authors:
Ioana Dumitriu;Joel Spencer
Affiliations:
Dept. of Math., U.C. Berkeley, 751 Evans Hall, Berkeley, CA 94720, USA;Courant Institute of Mathematical Sciences, 251 Mercer St., room 829, New York, NY 10012, USA
Venue:
Combinatorica
Year:
2005

Citing 0
Cited 2

Searching with lies under error cost constraints

Discrete Applied Mathematics
Two batch search with lie cost

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We introduce and analyze a liar game in which t-ary questions are asked and the responder may lie at most k times. As an additional constraint, there is an arbitrary but prescribed list (the channel) of permissible types of lies. For any fixed t, k, and channel, we determine the exact asymptotics of the solution when the number of queries goes to infinity.