The liar game over an arbitrary channel

Ioana Dumitriu, Joel Spencer

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)537-559
Number of pages23
JournalCombinatorica
Volume25
Issue number5
DOIs
StatePublished - Sep 2005

Fingerprint

Infinity
Query
Game
Arbitrary

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

The liar game over an arbitrary channel. / Dumitriu, Ioana; Spencer, Joel.

In: Combinatorica, Vol. 25, No. 5, 09.2005, p. 537-559.

Research output: Contribution to journalArticle

Dumitriu, Ioana ; Spencer, Joel. / The liar game over an arbitrary channel. In: Combinatorica. 2005 ; Vol. 25, No. 5. pp. 537-559.
@article{d32aff5e7f4d4b94bc7a74e72ed4aba6,
title = "The liar game over an arbitrary channel",
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.",
author = "Ioana Dumitriu and Joel Spencer",
year = "2005",
month = "9",
doi = "10.1007/s00493-005-0033-3",
language = "English (US)",
volume = "25",
pages = "537--559",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "5",

}

TY - JOUR

T1 - The liar game over an arbitrary channel

AU - Dumitriu, Ioana

AU - Spencer, Joel

PY - 2005/9

Y1 - 2005/9

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

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

UR - http://www.scopus.com/inward/record.url?scp=33646172754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646172754&partnerID=8YFLogxK

U2 - 10.1007/s00493-005-0033-3

DO - 10.1007/s00493-005-0033-3

M3 - Article

VL - 25

SP - 537

EP - 559

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 5

ER -