Stochastic packing-market planning

Daniel Golovin
2007 Proceedings of the 8th ACM conference on Electronic commerce - EC '07  
Motivated by the problem of centralized market clearing in a market with probabilistic supply and demand, we introduce the Stochastic Packing-Market Planning problem (SPMP), which is a stochastic generalization of the Maximum k-Set Packing problem. We provide an O(k) approximation algorithm for SPMP, as well as a O(k) approximation mechanism that is truthful in expectation. This matches up to constants the best approximation ratio known for Maximum k-Set Packing. Along the way, we develop
more » ... ques for obtaining sparse subhypergraphs of an input hypergraph that preserves EP (·) up to an O(k) factor, where EP (G) measures the expected weight of a maximum weight set packing in a random subhypergraph of G. We also give a linear programming based approximation for EP (G). These techniques may be of independent interest.
doi:10.1145/1250910.1250936 dblp:conf/sigecom/Golovin07 fatcat:sxjoy56abzhknpjej6vvxuxiri