Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes

by   Brian Brubach, et al.

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 the input which has led to the study of stochastic matching models. Here, each edge in the graph has a known, independent probability of existing derived from some prediction. Algorithms must probe edges to determine existence and match them irrevocably if they exist. Further, each vertex may have a patience constraint denoting how many of its neighboring edges can be probed. We present new ordered contention resolution schemes yielding improved approximation guarantees for some of the foundational problems studied in this area. For stochastic matching with patience constraints in general graphs, we provide a 0.382-approximate algorithm, significantly improving over the previous best 0.31-approximation of Baveja et al. (2018). When the vertices do not have patience constraints, we describe a 0.432-approximate random order probing algorithm with several corollaries such as an improved guarantee for the Prophet Secretary problem under Edge Arrivals. Finally, for the special case of bipartite graphs with unit patience constraints on one of the partitions, we show a 0.632-approximate algorithm that improves on the recent 1/3-guarantee of Hikima et al. (2021).



There are no comments yet.


page 1

page 2

page 3

page 4


A Simple 1-1/e Approximation for Oblivious Bipartite Matching

We study the oblivious matching problem, which aims at finding a maximum...

Improved Approximation Algorithms for Stochastic-Matching Problems

We consider the Stochastic Matching problem, which is motivated by appli...

Perturbed Greedy on Oblivious Matching Problems

We study the maximum matching problem in the oblivious setting, i.e. the...

Stochastic Vertex Cover with Few Queries

We study the minimum vertex cover problem in the following stochastic se...

Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models

Within the context of stochastic probing with commitment, we consider th...

Single-Sample Prophet Inequalities via Greedy-Ordered Selection

We study single-sample prophet inequalities (SSPIs), i.e., prophet inequ...

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack

Prophet inequalities are a useful tool for designing online allocation p...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.