Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …

The design of online algorithms for matching markets and revenue management settings is
usually bound by the stochastic prior that the demand process is formed by a fixed-length …

The prophet secretary problem is a combination of the prophet inequality and the secretary
problem, where elements are drawn from known independent distributions and arrive in …

We initiate the study of Stochastic Online Correlated Selection (SOCS), a family of online
rounding algorithms for the general Non-IID model of Stochastic Online Submodular Welfare …

Randomized rounding is a technique that was originally used to approximate hard offline
discrete optimization problems from a mathematical programming relaxation. Since then, it …

Sampling without replacement is a natural online rounding strategy for converting fractional
bipartite matching into an integral one. In Online Bipartite Matching, we can use the Balance …

Online matching is a fundamental problem in the study of online algorithms. We study the
problem under a very general arrival model: the edge arrival model. Free disposal is an …

We study an edge-weighted online stochastic\emph {Generalized Assignment Problem}
with\emph {unknown} Poisson arrivals. In this model, we consider a bipartite graph that …

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 …