Cover Image

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yahmed, Ahmed Ben, Ferchichi, Hafedh El, Abeille, Marc, Perchet, Vianney
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem
by: Cai, Junyang, et al.
Published: (2024)

Multi-Armed Sampling Problem and the End of Exploration
by: Pedramfar, Mohammad, et al.
Published: (2025)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
by: Simchi-Levi, David, et al.
Published: (2019)

Fair Clustering with Minimum Representation Constraints
by: Lawless, Connor, et al.
Published: (2024)

On the Hardness of Reinforcement Learning with Transition Look-Ahead
by: Pla, Corentin, et al.
Published: (2025)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
by: Park, Jiho, et al.
Published: (2025)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Reinforcement Learning for Intensity Control: An Application to Choice-Based Network Revenue Management
by: Meng, Huiling, et al.
Published: (2024)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Decentralized Contextual Bandits with Network Adaptivity
by: Deng, Chuyun, et al.
Published: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
by: Zibaie, Arghavan, et al.
Published: (2025)

Contextual Bandits with Budgeted Information Reveal
by: Gan, Kyra, et al.
Published: (2023)

Revenue Optimization with Price-Sensitive and Interdependent Demand
by: Laasri, Julien, et al.
Published: (2025)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

Calibrated Adversarial Sampling: Multi-Armed Bandit-Guided Generalization Against Unforeseen Attacks
by: Wang, Rui, et al.
Published: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Tight Rates for Bandit Control Beyond Quadratics
by: Sun, Y. Jennifer, et al.
Published: (2024)

Combinatorial Causal Bandits without Graph Skeleton
by: Feng, Shi, et al.
Published: (2023)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
by: Narasimha, Dheeraj, et al.
Published: (2025)

Bandit Allocational Instability
by: Chen, Yilun, et al.
Published: (2026)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
by: Liu, Keqin, et al.
Published: (2021)

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints
by: Sid-Ali, Ahmed, et al.
Published: (2023)

Learning Generative Dynamics with Soft Law Constraints: A McKean-Vlasov FBSDE Approach
by: Boustany, Samer El, et al.
Published: (2026)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

Exponentially Weighted Algorithm for Online Network Resource Allocation with Long-Term Constraints
by: Sid-Ali, Ahmed, et al.
Published: (2024)

Strong bounds for large-scale Minimum Sum-of-Squares Clustering
by: Croella, Anna Livia, et al.
Published: (2025)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
by: Li, Xuheng, et al.
Published: (2025)

Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
by: Guo, Xin, et al.
Published: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
by: Dai, Yan, et al.
Published: (2024)

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
by: Bu, Fanchen, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
by: Zhan, Jingxin, et al.
Published: (2025)

Neural Network-Based Bandit: A Medium Access Control for the IIoT Alarm Scenario
by: Raghuwanshi, Prasoon, et al.
Published: (2024)

FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization
by: Upadhyay, Antesh, et al.
Published: (2026)