The stochastic matching problem with (very) few queries
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery
2019
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |