Online non-monotone diminishing return submodular maximization in the bandit setting

DOI10.1007/S10898-024-01413-0MaRDI QIDQ6631565

Dachuan Xu, Xiao Wang, Jiachen Ju

Publication date: 1 November 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmregret boundbandit settingnon-monotone functionDR submodular maximization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regret in the on-line decision problem
• Adaptive seeding for profit maximization in social networks
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Online Learning and Online Convex Optimization
• Online Buy-at-Bulk Network Design
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints
• Universal portfolios with side information
• Submodularity Helps in Nash and Nonsymmetric Bargaining Games
• Internal regret in on-line portfolio selection
• Robust maximum capture facility location under random utility maximization models

This page was built for publication: Online non-monotone diminishing return submodular maximization in the bandit setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631565)