Before revision:  We first rigorously analyze a deterministic variant of the online threat model by drawing parallels to the well-studied k-secretary problem and propose  , a simple yet practical algorithm yielding a provably better competitive ratio for k=2 over the current best single threshold algorithm .
After revision:  We first rigorously analyze a deterministic variant of the online threat model by drawing parallels to the well-studied k-secretary problem and propose , a simple yet practical online algorithm. Our main theoretical result show Virtual+ yields provably the best competitive ratio over all single-threshold algorithms for k<5 -- extending previous analysis of the k-secretary problem .