Approximation in stochastic scheduling: the power of LP-based priority policies
Journal of the ACM (JACM)
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing
The Sample Average Approximation Method for Stochastic Discrete Optimization
SIAM Journal on Optimization
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Sampling-based Approximation Algorithms for Multi-stage Stochastic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Algorithmic Game Theory
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Mechanism design via correlation gap
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Price of Correlations in Stochastic Optimization
Operations Research
Prior-independent mechanisms for scheduling
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation between the random variables is unknown. In the robust model, the objective is to minimize expected cost against worst possible joint distribution with those marginals. We introduce the concept of correlation gap to compare this model to the stochastic optimization model that ignores correlations and minimizes expected cost under independent Bernoulli distribution. We identify a class of functions, using concepts of summable cost sharing schemes from game theory, for which the correlation gap is well-bounded and the robust model can be approximated closely by the independent distribution model. As a result, we derive efficient approximation factors for many popular cost functions, like submodular functions, facility location, and Steiner tree. As a byproduct, our analysis also yields some new results in the areas of social welfare maximization and existence of Walrasian equilibria, which may be of independent interest.