Almost Optimal Stochastic Weighted Matching with Few Queries
Authors:
Open Access
- 11 June 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 235-249
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- The Stochastic Matching Problem with (Very) Few Queries2016
- Ignorance is Almost Bliss2015
- Finding long chains in kidney exchange using the traveling salesman problemProceedings of the National Academy of Sciences, 2015
- Failure-aware kidney exchange2013
- A Stochastic Probing Problem with ApplicationsLecture Notes in Computer Science, 2013
- Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation2012
- Stochastic Matching with CommitmentLecture Notes in Computer Science, 2012
- Improved analysis of the greedy algorithm for stochastic matchingInformation Processing Letters, 2011
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic MatchingsAlgorithmica, 2011
- Approximating Matches Made in Heaven2009