Guessing with limited memory

Wasim Huleihel; Salman Salamatian; Muriel Medard

doi:10.1109/ISIT.2017.8006930

Guessing with limited memory

Wasim Huleihel, Salman Salamatian, Muriel Medard

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

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ényi entropy.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers
Pages	2253-2257
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006930
State	Published - 9 Aug 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2017.8006930

Cite this

@inproceedings{7d0d0f24998b4727b59f3e3720cf769b,

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 = "10.1109/ISIT.2017.8006930",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "2253--2257",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

address = "United States",

}

Huleihel, W, Salamatian, S & Medard, M 2017, Guessing with limited memory. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006930, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers, pp. 2253-2257, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006930

Guessing with limited memory. / Huleihel, Wasim; Salamatian, Salman; Medard, Muriel.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers, 2017. p. 2253-2257 8006930 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Guessing with limited memory

AU - Huleihel, Wasim

AU - Salamatian, Salman

AU - Medard, Muriel

PY - 2017/8/9

Y1 - 2017/8/9

N2 - 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ényi entropy.

AB - 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ényi entropy.

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

U2 - 10.1109/ISIT.2017.8006930

DO - 10.1109/ISIT.2017.8006930

M3 - Conference contribution

AN - SCOPUS:85034109638

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2253

EP - 2257

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

Guessing with limited memory

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this