Twenty (simple) questions

DOI10.1145/3055399.3055422zbMath1370.68085arXiv1611.01655OpenAlexW2555553669MaRDI QIDQ4977956

Shay Moran, Yuval Filmus, Yuval Dagan, Ariel Gabizon

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01655

zbMATH Keywords

information theoryredundancybinary decision treecombinatorial search theorytwenty-questions game

Mathematics Subject Classification ID

Applications of game theory (91A80) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial games (91A46) Prefix, length-variable, comma-free codes (94A45)

Related Items (5)

Optimal Sets of Questions for Twenty Questions ⋮ Edge and pair queries-random graphs and complexity ⋮ Classification via two-way comparisons (extended abstract) ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ An efficient noisy binary search in graphs via Median approximation

This page was built for publication: Twenty (simple) questions