P
Initializing...
Proof of Theorem 1, case M = ∅ and (1), pp. 6–7 — if no candidate deviates, Algorithm 1 hires ı̂ and v(ı̂) ≥ (1−ϵ)/(1+ϵ)·v(i) · Prove2Me