We consider a version of the game “Twenty Questions” played on the set {0,…,N-1} where the player giving answers may lie in her answers, for some fixed and previously known fraction of the answers.Expand

We consider the problem of searching for a quantity x in a discrete, bounded domain (e.g. $\{$1, ...,$n\}$) by asking "yes-no" questions, when some of the answers received may be lies. In particular,… Expand

In these notes, we sketch some of our work on learning with irrelevant attributes in Valiant’s PAC model [V84]. In the PAC model, the goal of the learner is to produce an approximately correct… Expand