We provide prophet inequality algorithms for online weighted matching in general (non-
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …

We introduce the abstract problem of rounding an unknown fractional bipartite b-matching x
revealed online (eg, output by an online fractional algorithm), exposed node-by-node on …

Online contention resolution schemes (OCRSs) were proposed by Feldman, Svensson, and
Zenklusen as a generic technique to round a fractional solution in the matroid polytope in an …

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 …

With a wide range of applications, stochastic matching problems have been studied in
different models, including prophet inequality, Query-Commit, and Price-of-Information …

Matching is one of the most fundamental and broadly applicable problems across many
domains. In these diverse real-world applications, there is often a degree of uncertainty in …

In this paper, we study contention resolution schemes for matchings. Given a fractional
matching x and a random set R (x) where each edge e appears independently with …

Relaxation and rounding approaches became a standard and extremely versatile tool for
constrained submodular function maximization. One of the most common rounding …

Contention resolution schemes (or CR schemes), introduced by Chekuri, Vondrak and
Zenklusen, are a class of randomized rounding algorithms for converting a fractional …

The contention resolution framework is a versatile rounding technique used as a part of the
relaxation and rounding approach for solving constrained submodular function maximization …