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 …

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 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 …

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 study the power of multiple choices in online stochastic matching. Despite a long line of
research, existing algorithms still only consider two choices of offline neighbors for each …

Abstract Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards,
which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani …

We study the edge-weighted online stochastic matching problem. Since [6] introduced the
online stochastic matching problem and proposed the ()-competitive Suggested Matching …

This paper studies online correlated selection (OCS). Suppose that we receive a pair of
elements in each round and select one of them. Can we select with negative correlation to …

We study the classic online bipartite matching problem with a twist: offline nodes are
reusable any number of times. Every offline node i becomes available d steps after it was …

We initiate the study of fairness among classes of agents in online bipartite matching where
there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that …