coping with Delays and Time-Outs in Binary Search Procedures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
Among the models of delayed search discussed in [1], [2], the simplest one can be formulated as the following two–player game. One player, say A, holds a secret number $m\in{\mathcal M}\triangleq\{1,2,\dots,M\}$ and another player, say Q, tries to learn the secret number by asking A at time i questions, like “Is m≥xi?”, where xi is a number chosen by Q. The rule is that at time i + dA must answer Q 's question at time i correctly and at time jQ can choose xj according to all answers he has received.