@inproceedings{1363cf93bd644b2babbe6267695e034c,
title = "Guessing with limited memory",
abstract = "Suppose that we wish to guess the realization x of a discrete random variable X taking values in a finite set, by asking sequential questions of the form 'Is X is equal to x?' exhausting the elements of X until the answer is Yes. [1, 2]. If the distribution of X is known to the guesser, and the guesser has memory of his previous has memory of his previous queries then the best strategy is to guess in decreasing order of probabilities. In this paper, we consider the problem of a memoryless guesser, namely, each new guess is independent of the previous guesses. We consider also the scenario of a guesser with a bounded number of guesses. For both cases we derive the optimal guessing strategies, and show new connections to R{\'e}nyi entropy.",
author = "Wasim Huleihel and Salman Salamatian and Muriel Medard",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "https://doi.org/10.1109/ISIT.2017.8006930",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2253--2257",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "الولايات المتّحدة",
}