Beating (1-1/e)-Approximation for Weighted Stochastic Matching

2022/10/31 by Mahsa Derakhshan, Derakhshan, Mahsa, Alireza Farhadi +1 · 2 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Optimization and Search Problems

paper · pdf · doi:10.48550/arxiv.2210.17515

openalex publication_date 2022/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In the stochastic weighted matching problem, the goal is to find a large-weight matching of a graph when we are uncertain about the existence of its edges. In particular, each edge e has a known weight w_e but is realized independently with some probability p_e. The algorithm may query an edge to see whether it is realized. We consider the well-studied query commit version of the problem, in which any queried edge that happens to be realized must be included in the solution. Gamlath, Kale, and Svensson showed that when the input graph is bipartite, the problem admits a (1-1/e)-approximation. In this paper, we give an algorithm that for an absolute constant δ> 0.0014 obtains a (1-1/e+δ)-approximation, therefore breaking this prevalent bound.

Cited by

• Commitment Gap via Correlation Gap
• Edge-weighted Matching in the Dark

Related

• Query Efficient Weighted Stochastic Matching
• Almost Optimal Stochastic Weighted Matching With Few Queries
• Stochastic Matching with Few Queries: (1-ε) Approximation
• Stochastic Matching with Few Queries: New Algorithms and Tools
• Stochastic Weighted Matching: (1-ε) Approximation