Before revision:  Further, an application of our algorithm to dynamic pricing ( a version in which the algorithm repeatedly adjusts prices for a product) enjoys these regret bounds without any smoothness assumptions.
After revision:  Further, an application of our algorithm to dynamic pricing ( where a seller repeatedly adjusts prices for a product) enjoys these regret bounds without any smoothness assumptions.