The interval liar game

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We regard the problem of communication in the presence of faulty transmissions. In contrast to the classical works in this area, we assume some structure on the times when the faults occur. More realistic seems the "burst error model", in which all faults occur in some small time interval. Like previous work, our problem can best be modelled as a two-player perfect information game, in which one player ("Paul") has to guess a number x from {1, ..., n} using Yes/No-questions, which the second player ("Carole") has to answer truthfully apart from few lies. In our setting, all lies have to be in a consecutive set of k rounds. We show that (for big n) Paul needs roughly logn+loglogn+k rounds to determine the number, which is only k more than the case of just one single lie.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings
Pages318-327
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event17th International Symposium on Algorithms and Computation, ISAAC 2006 - Kolkata, India
Duration: 18 Dec 200620 Dec 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4288 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Symposium on Algorithms and Computation, ISAAC 2006
Country/TerritoryIndia
CityKolkata
Period18/12/0620/12/06

Fingerprint

Dive into the research topics of 'The interval liar game'. Together they form a unique fingerprint.

Cite this