Competitive Group Testing.

Let M sub A (n, d) denote the maximum number of group tests for a group testing algorithm A to identify d defectives from a set of n items when d is known, and let M sub A(n|d) denote the number when d is unknown. Define M(n, d) = min sub A M sub A(n, d). An algorithm A is called a competitive algorithm if there exist constants c and a such that for all n > d > 0,M sub A(n|d)