The Liar Game Over an Arbitrary Channel
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...
Saved in:
| Published in | Combinatorica (Budapest. 1981) Vol. 25; no. 5; pp. 537 - 559 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Heidelberg
Springer Nature B.V
01.09.2005
|
| Online Access | Get full text |
| ISSN | 0209-9683 1439-6912 |
| DOI | 10.1007/s00493-005-0033-3 |
Cover
| Summary: | 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. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0209-9683 1439-6912 |
| DOI: | 10.1007/s00493-005-0033-3 |