Finding the maximum and minimum elements with one lie

Authors:
Dániel Gerbner;Dömötör Pálvölgyi;Balázs Patkós;Gábor Wiener
Affiliations:
Rényi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda utca 13-15., 1053 Budapest, Hungary;Department of Computer Science, Eötvös University, Pázmány Péter sétány 1/c, 1117 Budapest, Hungary;Department of Computer Science, Eötvös University, Pázmány Péter sétány 1/c, 1117 Budapest, Hungary;Department of Computer Science and Information Theory, Budapest University of Technology, 1117 Budapest, Magyar tudósok körútja 2, Hungary
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 4
Cited 1

On selecting the largest element in spite of erroneous information

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Finding the maximum and minimum

Discrete Applied Mathematics
A sorting problem and its complexity

Communications of the ACM
Searching games with errors---fifty years of coping with liars

Theoretical Computer Science

Minimum and maximum against k lies

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size n 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 c. We also address some related problems.