On the Optimal Pairwise Group Testing Algorithm

07/21/2022

∙

by   Viktor Skorniakov, et al.

∙

0

∙

share

Originally suggested for the blood testing problem by Dorfman in 1943, an idea of Group Testing (GT) has found many applications in other fields as well. Among many (binomial) GT procedures introduced since then, in 1990, Yao and Hwang proposed the Pairwise Testing Algorithm (PTA) and demonstrated that PTA is the unique optimal nested GT procedure provided the probability of contamination lies in [1-√(2)/2,3-√(5)/2]. Despite the fundamental nature of the result, PTA did not receive considerable attention in the literature. In particular, even its basic probabilistic properties remained unexplored. In this paper, we fill the gap by providing an exhaustive characterization of probabilistic PTA properties.