When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
- First Online:
- 262 Downloads
We give a 4 approximation for weighted stochastic matching on general graphs, and a 3 approximation on bipartite graphs. This answers an open question from Chen et al. (ICALP’09, LNCS, vol. 5555, pp. 266–278, ).
We introduce a generalization of the stochastic online matching problem (Feldman et al. in FOCS’09, pp. 117–126, ) that also models preference-uncertainty and timeouts of buyers, and give a constant factor approximation algorithm.
KeywordsStochastic optimization Stochastic packing Online dating Dependent rounding
Unable to display preview. Download preview PDF.