Before revision:  To complete the discussion , we employ the notion of permutational Rademacher complexity and analyze the regret of two online LP algorithms in the literature under the random permutation model .
After revision:  To complete the discussion , we employ the notion of permutational Rademacher complexity and analyze the regret of two online LP algorithms for comparison. Both algorithms improve the regret bound with a factor of \sqrt{m .