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).


page 1

page 2

page 3

page 4


On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs

We present new results for online contention resolution schemes for the ...

Online Bipartite Matching in the Probe-Commit Model

We consider the classical online bipartite matching problem in the probe...

Improved Approximation Algorithms for Stochastic-Matching Problems

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

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark

In this paper, we study max-weight stochastic matchings on online bipart...

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

Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process

We introduce a novel and efficient sampling algorithm for the Multiplica...

Please sign up or login with your details

Forgot password? Click here to reset