We study maximum selection and sorting of n numbers using imperfect pairwise
comparators. The imperfect comparator returns the larger of the two inputs if the inputs are
more than a given threshold apart and an adversarially-chosen input otherwise. We
consider two adversarial models: a non-adaptive adversary that decides on the outcomes in
advance and an adaptive adversary that decides on the outcome of each comparison
depending on the previous comparisons and outcomes. Against the non-adaptive …

We study maximum selection and sorting of $ n $ numbers using pairwise comparators that
output the larger of their two inputs if the inputs are more than a given threshold apart, and
output an adversarially-chosen input otherwise. We consider two adversarial models. A non-
adaptive adversary that decides on the outcomes in advance based solely on the inputs,
and an adaptive adversary that can decide on the outcome of each query depending on
previous queries and outcomes. Against the non-adaptive adversary, we derive a maximum …