We present an efficient randomized algorithm that guarantees O(√T log T) expected maximum swap regret (MSR) in online binary prediction, matching the Ω(√T) lower bound up to a logarithmic factor.
