English

Reducing Guesswork via an Unreliable Oracle

Information Theory 2018-06-15 v2 math.IT

Abstract

Alice holds an random variable XX, and Bob is trying to guess its value by asking questions of the form "is X=xX=x?". Alice answers truthfully and the game terminates once Bob guesses correctly. Before the game begins, Bob is allowed to reach out to an oracle, Carole, and ask her any yes/no question, i.e., a question of the form "is XAX\in A?". Carole is known to lie with a given probability pp. What should Bob ask Carole if he would like to minimize his expected guessing time? When Carole is always truthful (p=0p=0), it is not difficult to check that Bob should order the symbol probabilities in descending order, and ask Carole whether the index of XX w.r.t this order is even or odd. We show that this strategy is almost optimal for any lying probability pp, up to a small additive constant upper bounded by a 1/41/4. We discuss a connection to the cutoff rate of the BSC with feedback.

Cite

@article{arxiv.1703.01672,
  title  = {Reducing Guesswork via an Unreliable Oracle},
  author = {Amir Burin and Ofer Shayevitz},
  journal= {arXiv preprint arXiv:1703.01672},
  year   = {2018}
}
R2 v1 2026-06-22T18:36:13.662Z