The Liar Game Over an Arbitrary Channel
- Cite this article as:
- Dumitriu, I. & Spencer, J. Combinatorica (2005) 25: 537. doi:10.1007/s00493-005-0033-3
- 54 Downloads
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.