The Stochastic Matching Problem with (Very) FewQueries

ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2019.

Cited by: 0|Bibtex|Views5|DOI:https://doi.org/10.1145/3355903

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments