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 …

Online bipartite matching is one of the most fundamental problems in the online algorithms
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …

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 …

The classic theorem of Vizing (Diskret. Analiz.'64) asserts that any graph of maximum
degree Δ can be edge colored (offline) using no more than Δ+ 1 colors (with Δ being a trivial …

We present a deterministic (1+ ε)-approximate maximum matching algorithm in poly (1/ε)
passes in the semi-streaming model, solving the long-standing open problem of breaking …

The rich literature on online Bayesian selection problems has long focused on so-called
prophet inequalities, which compare the gain of an online algorithm to that of a" prophet" …

Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no online edge-coloring
algorithm can edge color a graph optimally. Indeed, their work, titled" the greedy algorithm is …

We present a new dynamic matching sparsification scheme. From this scheme we derive a
framework for dynamically rounding fractional matchings against adaptive adversaries …

In this paper, we study max-weight stochastic matchings on online bipartite graphs under
both vertex and edge arrivals. We focus on designing polynomial time approximation …

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 …