Almost Optimal Stochastic Weighted Matching With Few Queries

Soheil Behnezhad, Nima Reyhani

We consider the {\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph $G(V,E)$ is given in the input, where each edge in $E$ is {\em…