Image de couverture de livre

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Udwani, Rajan
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
par: Udwani, Rajan
Publié: (2023)

Submodular Order Functions and Assortment Optimization
par: Udwani, Rajan
Publié: (2021)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
par: Goyal, Vineet, et autres
Publié: (2020)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Adwords with Unknown Budgets and Beyond
par: Udwani, Rajan
Publié: (2021)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
par: Ganz, Amit, et autres
Publié: (2023)

A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
par: Kang, Suho, et autres
Publié: (2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
par: Chen, Yixin, et autres
Publié: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
par: Cui, Shuang, et autres
Publié: (2023)

When Location Shapes Choice: Placement Optimization of Substitutable Products
par: Housni, Omar El, et autres
Publié: (2023)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
par: Cervenjak, Philip, et autres
Publié: (2023)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
par: Chen, Wenjing, et autres
Publié: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
par: Cervenjak, Philip, et autres
Publié: (2026)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
par: Buchbinder, Niv, et autres
Publié: (2025)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
par: Buchbinder, Niv, et autres
Publié: (2026)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
par: Spaeh, Fabian, et autres
Publié: (2025)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
par: Chen, Yixin, et autres
Publié: (2020)

Submodular Maximization in Exactly $n$ Queries
par: Balkanski, Eric, et autres
Publié: (2024)

Regularized Unconstrained Weakly Submodular Maximization
par: Zhu, Yanhui, et autres
Publié: (2024)

Learning-Augmented Dynamic Submodular Maximization
par: Agarwal, Arpit, et autres
Publié: (2023)

A Poisson Process for Submodular Maximization
par: Rozenman, Amit Ganz, et autres
Publié: (2026)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
par: Wang, Honglian, et autres
Publié: (2026)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
par: Amanatidis, Georgios, et autres
Publié: (2020)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
par: Amanatidis, Georgios, et autres
Publié: (2021)

Consistent Submodular Maximization
par: Dütting, Paul, et autres
Publié: (2024)

Subquadratic Submodular Maximization with a General Matroid Constraint
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Fair Submodular Maximization over a Knapsack Constraint
par: Li, Lijun, et autres
Publié: (2025)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Fixed-Parameter Tractable Submodular Maximization over a Matroid
par: Nematollahi, Shamisa, et autres
Publié: (2025)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
par: Chen, Yixin, et autres
Publié: (2021)

Maximization of Approximately Submodular Functions
par: Horel, Thibaut, et autres
Publié: (2024)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
par: Hao, Yimin, et autres
Publié: (2025)