Research map / Learning theory and algorithms / Submodular and game algorithms
Stochastic Submodular Maximization with Performance-Dependent Item Costs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Stochastic Submodular Maximization: The Case of Coverage Functions (NeurIPS 2017 · similarity 0.90)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.88)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.88)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.87)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.87)
- Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.