Truth tellers and liars with fewer questions

We study the problem of using binary questions to identify a single truth teller from a collection of p players, at most ¿ of whom may lie. Our focus is on trying to solve the problem using ¿ (or slightly more than ¿ ) questions, which is the fewest feasible number of questions. We also obtain a randomized solution for instances of the problem that are not possible to solve deterministically.