The Stochastic Matching Problem with (Very) FewQueries
ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2019.
Motivated by an application in kidney exchange, we study the following stochastic matching problem: We are given a graph G(V, E) (not necessarily bipartite), where each edge in E is realized with some constant probability p > 0, and the goal is to find a maximum matching in the realized graph. An algorithm in this setting is allowed to ma...More
Full Text (Upload PDF)
PPT (Upload PPT)