SIGACT News Online Algorithms Column 42

For this issue, I am pleased to present a tutorial by Will Ma on using randomized rounding to design online policies. Randomized rounding has of course been used extensively in the design of approximation algorithms and also to approximately solve sequential stochastic optimization problems. Will describes several examples that show how randomized rounding can be used in this context. As always, I would like to invite more contributions to this column, be it surveys, conference reports, or technical articles related to online algorithms and competitive analysis. If you are considering becoming a guest writer, don't hesitate to mail me at [email protected].