Finding the maximum and minimum

Abstract

AbstractWe consider the problem of finding the maximum out of a list of n ordered items with binary comparisons where the pth fraction of the answers may be false. It is shown that the maximum can be determined iff p < 12 and that a successful strategy needs Θ(11−p)n questions. A few similar problems are also discussed, including the problem of finding the maximum and minimum simultaneously with lies and in the nuts and bolts model