Improved analysis of the greedy algorithm for stochastic matching

Authors:
Marek Adamczyk
Affiliations:
Faculty of Mathematics, Informatics and Mechanics at the University of Warsaw, Banacha 2, 02-097 Warsaw, Poland
Venue:
Information Processing Letters
Year:
2011

Citing 2
Cited 3

Approximating Matches Made in Heaven

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
When LP is the cure for your matching woes: improved bounds for stochastic matchings

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II

Stochastic matching with commitment

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A stochastic probing problem with applications

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Harnessing the power of two crossmatches

Proceedings of the fourteenth ACM conference on Electronic commerce

Quantified Score

Hi-index	0.89

Visualization

Abstract

The stochastic matching problem with applications in online dating and kidney exchange was introduced by Chen et al. (2009) [1] together with a simple greedy strategy. They proved it is a 4-approximation, but conjectured that the greedy algorithm is in fact a 2-approximation. In this paper we confirm this hypothesis.