Matching is a classic problem with a rich history and a significant impact, both on the theory
of algorithms and in practice. Recently there has been a surge of interest in the online …

Dependent rounding is a useful technique for optimization problems with hard budget
constraints. This framework naturally leads to negative correlation properties. However, what …

We introduce a new rounding technique designed for online optimization problems, which is
related to contention resolution schemes, a technique initially introduced in the context of …

Rideshare platforms, when assigning requests to drivers, tend to maximize profit for the
system and/or minimize waiting time for riders. Such platforms can exacerbate biases that …

Online Contention Resolution Schemes (OCRSs) represent a modern tool for selecting a
subset of elements, subject to resource constraints, when the elements are presented to the …

We study a general stochastic probing problem defined on a universe V, where each
element e∈ V is “active” independently with probability pe. Elements have weights {we: e∈ …

Consider a random graph model where each possible edge e is present independently with
some probability pe. Given these probabilities, we want to build a large/heavy matching in …

We consider the generalizations of two classical problems, online bipartite matching and ski
rental, in the field of online algorithms, and establish a novel connection between them. In …

Consider a network design application where we wish to lay down a minimum-cost
spanning tree in a given graph; however, we only have stochastic information about the …

Background. Our results tie into the literature on contention resolution schemes [3], which we
briefly define. Let P (𝐺) denote the fractional matching polytope of a graph 𝐺=(𝑉, 𝐸). In a …