New ordered contention resolution schemes achieve approximation ratios of 0.382 (general graphs, patience >=2), 0.432 (no patience), and 0.632 (bipartite unit patience) for offline stochastic matching.
Proceedings of the 21st ACM Conference on Economics and Computation, 769–787
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
New ordered contention resolution schemes achieve approximation ratios of 0.382 (general graphs, patience >=2), 0.432 (no patience), and 0.632 (bipartite unit patience) for offline stochastic matching.