Online risk-averse submodular maximization
From MaRDI portal
Publication:2678600
DOI10.1007/S10479-022-04835-9OpenAlexW4297174310MaRDI QIDQ2678600
Publication date: 23 January 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09838
Statistical methods; risk measures (91G70) Optimal stochastic control (93E20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Risk averse submodular utility maximization
- Conditional value at risk and related linear programming models for portfolio optimization
- Submodular functions and optimization.
- Symmetry and Approximability of Submodular Maximization Problems
- Online Prediction under Submodular Constraints
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- On the Generalization Ability of On-Line Learning Algorithms
- Deterministic Algorithms for Submodular Maximization Problems
This page was built for publication: Online risk-averse submodular maximization