Before revision:  Furthermore, the algorithm is generalized to a multi-dimensional LP setting which covers a wider range of applications and features for the same performance guarantee .
After revision:  Furthermore, the algorithm is generalized to a multi-dimensional LP setting which covers a wider range of applications . 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. Furthermore, we demonstrate how to convert the possibly infeasible solution to a feasible one through a randomized procedure .