We give a simple and computationally efficient algorithm that, for any constant ε> 0, obtains ε
T-swap regret within only T=(n) rounds; this is an exponential improvement compared to the …