{"total":25,"rows":[{"id":"2211.07484","title":"Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression","created":"2022-11-14","cited_by_count":30,"area":null},{"id":"2405.16118","title":"Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints","created":"2024-05-25","cited_by_count":10,"area":null},{"id":"2211.14720","title":"Rectified Pessimistic-Optimistic Learning for Stochastic Continuum-armed Bandit with Constraints","created":"2022-11-27","cited_by_count":9,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2405.06575","title":"No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization","created":"2024-05-10","cited_by_count":6,"area":null},{"id":"2409.20489","title":"Online Decision Deferral under Budget Constraints","created":"2024-09-30","cited_by_count":5,"area":null},{"id":"2311.01327","title":"High-dimensional Linear Bandits with Knapsacks","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2501.14155","title":"Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices","created":"2025-01-24","cited_by_count":3,"area":null},{"id":"2503.14796","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","created":"2025-03-19","cited_by_count":3,"area":null},{"id":"2509.25777","title":"Online Decision Making with Generative Action Sets","created":"2025-09-30","cited_by_count":3,"area":null},{"id":"2608.04333","title":"Cost-Aware Multi-Objective Bandits: Theory and Application to Budgeted LLM Configuration Evaluation","created":"2026-08-05","cited_by_count":3,"area":null},{"id":"2606.05606","title":"Cross-Epoch Adaptive Rollout Optimization for RL Post-Training","created":"2026-06-04","cited_by_count":2,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2401.01077","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","created":"2024-01-02","cited_by_count":1,"area":null},{"id":"2405.04910","title":"Learning with Posterior Sampling for Revenue Management under Time-varying Demand","created":"2024-05-08","cited_by_count":1,"area":null},{"id":"2509.15073","title":"Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits","created":"2025-09-18","cited_by_count":1,"area":null},{"id":"2602.18114","title":"Non-Stationary Online Resource Allocation: Learning from a Single Sample","created":"2026-02-20","cited_by_count":1,"area":null},{"id":"2609.00662","title":"Drift-Aware LLM Routing with Sparse Contexts and Shared Budgets","created":"2026-09-01","cited_by_count":1,"area":null},{"id":"2302.00997","title":"Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning","created":"2023-02-02","cited_by_count":0,"area":null},{"id":"2401.16945","title":"Online Resource Allocation with Non-Stationary Customers","created":"2024-01-30","cited_by_count":0,"area":null},{"id":"2501.18560","title":"Bandits with Anytime Knapsacks","created":"2025-01-30","cited_by_count":0,"area":null},{"id":"2603.14673","title":"A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming","created":"2026-03-15","cited_by_count":0,"area":null},{"id":"2606.09623","title":"Constrained user-item allocation for e-commerce marketing campaigns","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2606.17489","title":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2607.13546","title":"From Novice to Expert: Cost-Aware Bandits for Evolving Worker Performance in Crowdsensing","created":"2026-07-15","cited_by_count":0,"area":null}],"next_cursor":null}