Stochastic Submodular Maximization

Authors:
Arash Asadpour;Hamid Nazerzadeh;Amin Saberi
Affiliations:
Stanford University, Stanford,;Stanford University, Stanford,;Stanford University, Stanford,
Venue:
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Year:
2008

Citing 9
Cited 4

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Segmentation problems

Journal of the ACM (JACM)
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the submodularity of influence in social networks

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Maximizing Non-Monotone Submodular Functions

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
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
Near-optimal observation selection using submodular functions

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Stochastic covering and adaptivity

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Constrained non-monotone submodular maximization: offline and secretary algorithms

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Adaptive submodularity: theory and applications in active learning and stochastic optimization

Journal of Artificial Intelligence Research
Submodular secretary problem and extensions

ACM Transactions on Algorithms (TALG)
Note: Adaptivity in the stochastic blackjack knapsack problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study stochastic submodular maximization problem with respect to a cardinality constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study non-adaptive and adaptive policies and give optimal constant approximation algorithms for both cases. We also bound the adaptivity gap of the problem between 1.21 and 1.59.