Almost Optimal Stochastic Weighted Matching With Few Queries

10/29/2017
by   Soheil Behnezhad, et al.
0

We consider the stochastic matching problem. An edge-weighted general graph G(V, E) is given in the input, where each edge in E is realized independently with probability p. The realization is initially unknown, however, we are able to query the edges to determine whether they are realized. The goal is to query only a small number of edges to find a realized matching that is sufficiently close to the optimum (i.e., the maximum matching among all realized edges). The stochastic matching problem has been studied extensively during the past decade because of its numerous real-world applications in kidney-exchange, matchmaking services, online labor markets, advertisement, etc. Our main result is an adaptive algorithm that, in expectation, finds a (1-ϵ)-approximation by querying only O(1) edges per vertex. Prior to our work, no nontrivial approximation was known for weighted graphs using a constant per-vertex budget. The only known result for weighted graphs is the algorithm of Maehara and Yamaguchi (SODA'18) that achieves a (1-ϵ)-approximation by querying Θ(wn) edges per vertex where w is the maximum edge-weight. Our result is a substantial improvement over this bound and has an appealing practical message: No matter what the structure of the input graph is, one can get arbitrarily close to the optimum solution by querying only a constant number of edges per vertex. To obtain our results, we introduce novel properties of weighted augmenting paths that may be of independent interest in generalizing augmenting path based techniques to weighted graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2022

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

In the stochastic weighted matching problem, the goal is to find a large...
research
11/08/2018

Stochastic Matching with Few Queries: New Algorithms and Tools

We consider the following stochastic matching problem on both weighted a...
research
02/27/2020

Stochastic Matching with Few Queries: (1-ε) Approximation

Suppose that we are given an arbitrary graph G=(V, E) and know that each...
research
05/29/2022

Generalized Stochastic Matching

In this paper, we generalize the recently studied Stochastic Matching pr...
research
12/10/2021

Stochastic Vertex Cover with Few Queries

We study the minimum vertex cover problem in the following stochastic se...
research
08/13/2013

Extended Distributed Learning Automata:A New Method for Solving Stochastic Graph Optimization Problems

In this paper, a new structure of cooperative learning automata so-calle...
research
06/12/2021

Decentralized Matching in a Probabilistic Environment

We consider a model for repeated stochastic matching where compatibility...

Please sign up or login with your details

Forgot password? Click here to reset