Playing Twenty Questions with a Procrastinator


We study the classic binary search problem, with a delay between query and answer. For all constant delays, we give upper and lower bounds, matching up to an additive constant. 


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics