The individual-testing optimality conjecture above the threshold γ1\gamma_1

Let xx be the prevalence of a condition in a homogeneous population, let γ1\gamma_1 be the threshold at which the elementary algorithm A1\mathcal A_1 becomes dominant, and let A1\mathcal A_1 denote individual testing. Individual-testing optimality conjecture. There is no better homogeneous population algorithm than A1\mathcal A_1 when x>γ1x > \gamma_1: patients are to be tested individually. The statement concerns the region above x=1/2x=1/2 identified as a shortcoming of the basic algorithms; the source gives no proof or resolution, so its status remains open.

Sources & referencesView supporting material

Primary source

Éric Brier, Megi Dervishi, Rémi Géraud-Stewart, David Naccache and Ofer Yifrach-Stav, “Near-Optimal Pool Testing under Urgency Constraints”, arXiv:2106.10971 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.