TY - JOUR
T1 - Twenty (Short) Questions
AU - Dagan, Yuval
AU - Filmus, Yuval
AU - Gabizon, Ariel
AU - Moran, Shay
N1 - Publisher Copyright:
© 2019, János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.
PY - 2019/6/1
Y1 - 2019/6/1
N2 - A basic combinatorial interpretation of Shannon’s entropy function is via the “20 questions” game. This cooperative game is played by two players, Alice and Bob: Alice picks a distribution π over the numbers {1, …, n}, and announces it to Bob. She then chooses a number x according to π, and Bob attempts to identify x using as few Yes/No queries as possible, on average. An optimal strategy for the “20 questions” game is given by a Huffman code for π: Bob’s questions reveal the codeword for x bit by bit. This strategy finds x using fewer than H(π) + 1 questions on average. However, the questions asked by Bob could be arbitrary. In this paper, we investigate the following question: Are there restricted sets of questions that match the performance of Huffman codes, either exactly or approximately? Our main result gives a set Q of 1.25n+o(n) questions such that for every distribution π, Bob can implement an optimal strategy for π using only questions from Q. We also show that 1.25n−o(n) allowed questions are needed, for infinitely many n. When allowing a small slack of r questions for identifying x over the optimal strategy, we show that a set of roughly (rn)Θ(1/r) allowed questions is necessary and sufficient.
AB - A basic combinatorial interpretation of Shannon’s entropy function is via the “20 questions” game. This cooperative game is played by two players, Alice and Bob: Alice picks a distribution π over the numbers {1, …, n}, and announces it to Bob. She then chooses a number x according to π, and Bob attempts to identify x using as few Yes/No queries as possible, on average. An optimal strategy for the “20 questions” game is given by a Huffman code for π: Bob’s questions reveal the codeword for x bit by bit. This strategy finds x using fewer than H(π) + 1 questions on average. However, the questions asked by Bob could be arbitrary. In this paper, we investigate the following question: Are there restricted sets of questions that match the performance of Huffman codes, either exactly or approximately? Our main result gives a set Q of 1.25n+o(n) questions such that for every distribution π, Bob can implement an optimal strategy for π using only questions from Q. We also show that 1.25n−o(n) allowed questions are needed, for infinitely many n. When allowing a small slack of r questions for identifying x over the optimal strategy, we show that a set of roughly (rn)Θ(1/r) allowed questions is necessary and sufficient.
UR - http://www.scopus.com/inward/record.url?scp=85061373124&partnerID=8YFLogxK
U2 - 10.1007/s00493-018-3803-4
DO - 10.1007/s00493-018-3803-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0209-9683
VL - 39
SP - 597
EP - 626
JO - Combinatorica
JF - Combinatorica
IS - 3
ER -