In this paper we study stochastic matching problems that are motivated by
applications in online dating and kidney exchange programs. We consider two
probing models: edge probing and matching probing.

Our main result is an algorithm that finds a matching-probing strategy
attaining a small constant approximation ratio. An interesting aspect of our
approach is that we compare the cost our solution to the best edge-probing
strategy. Thus, we indirectly show that the best matching-probing strategy is
only a constant factor away from the best edge-probing strategy.