Finding the maximum and minimum elements with one lie

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size nn using pairwise comparisons if one of the comparisons might be erroneous and prove a conjecture of Aigner stating that the minimum number of comparisons needed is 87n32+c for some constant cc. We also address some related problems.