A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Stochastic packing-market planning
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
doi:10.1145/1250910.1250936
dblp:conf/sigecom/Golovin07
fatcat:sxjoy56abzhknpjej6vvxuxiri