{"total":44,"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":"2102.05295","title":"An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints","created":"2021-02-10","cited_by_count":29,"area":null},{"id":"2103.10246","title":"Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising","created":"2021-03-16","cited_by_count":25,"area":null},{"id":"2209.13694","title":"Safe Linear Bandits over Unknown Polytopes","created":"2022-09-27","cited_by_count":14,"area":null},{"id":"2206.07316","title":"Online Contextual Decision-Making with a Smart Predict-then-Optimize Method","created":"2022-06-15","cited_by_count":12,"area":null},{"id":"2210.11834","title":"Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles","created":"2022-10-21","cited_by_count":12,"area":null},{"id":"2109.08792","title":"Learning to be Fair: A Consequentialist Approach to Equitable Decision-Making","created":"2021-09-18","cited_by_count":11,"area":null},{"id":"2205.14572","title":"No-regret Learning in Repeated First-Price Auctions with Budget Constraints","created":"2022-05-29","cited_by_count":9,"area":null},{"id":"2308.15006","title":"Directional Optimism for Safe Linear Bandits","created":"2023-08-29","cited_by_count":8,"area":null},{"id":"2203.15629","title":"Stochastic Conservative Contextual Linear Bandits","created":"2022-03-29","cited_by_count":6,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2306.08470","title":"Bandits with Replenishable Knapsacks: the Best of both Worlds","created":"2023-06-14","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":"2302.01203","title":"Online Learning under Budget and ROI Constraints via Weak Adaptivity","created":"2023-02-02","cited_by_count":5,"area":null},{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"area":null},{"id":"2202.13710","title":"Best of Many Worlds Guarantees for Online Learning with Knapsacks","created":"2022-02-28","cited_by_count":4,"area":null},{"id":"2306.07709","title":"Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets","created":"2023-06-13","cited_by_count":4,"area":null},{"id":"2309.08709","title":"Price of Safety in Linear Best Arm Identification","created":"2023-09-15","cited_by_count":4,"area":null},{"id":"2102.04824","title":"A Multi-Arm Bandit Approach To Subset Selection Under Constraints","created":"2021-02-09","cited_by_count":3,"area":null},{"id":"2206.00314","title":"Contextual Bandits with Knapsacks for a Conversion Model","created":"2022-06-01","cited_by_count":3,"area":null},{"id":"2211.13952","title":"Contextual Decision-Making with Knapsacks Beyond the Worst Case","created":"2022-11-25","cited_by_count":3,"area":null},{"id":"2305.18511","title":"Contextual Bandits with Budgeted Information Reveal","created":"2023-05-29","cited_by_count":3,"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.08961","title":"Multiplayer Information Asymmetric Contextual Bandits","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2607.23765","title":"WISERouter: LLM Routing with Workload Budget Constraint","created":"2026-07-26","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":"2207.04690","title":"Dynamic Budget Throttling in Repeated Second-Price Auctions","created":"2022-07-11","cited_by_count":2,"area":null},{"id":"2210.13573","title":"Conditionally Risk-Averse Contextual Bandits","created":"2022-10-24","cited_by_count":2,"area":null},{"id":"2305.15807","title":"Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness","created":"2023-05-25","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":"2312.09961","title":"Risk-Aware Continuous Control with Neural Contextual Bandits","created":"2023-12-15","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":"2102.08087","title":"Making the most of your day: online learning for optimal allocation of time","created":"2021-02-16","cited_by_count":0,"area":null},{"id":"2308.10722","title":"Clustered Linear Contextual Bandits with Knapsacks","created":"2023-08-21","cited_by_count":0,"area":null},{"id":"2310.14164","title":"$\\alpha$-Fair Contextual Bandits","created":"2023-10-22","cited_by_count":0,"area":null},{"id":"2405.11417","title":"Budgeted Recommendation with Delayed Feedback","created":"2024-05-19","cited_by_count":0,"area":null},{"id":"2412.03983","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","created":"2024-12-05","cited_by_count":0,"area":null},{"id":"2505.16918","title":"Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype","created":"2025-05-22","cited_by_count":0,"area":null},{"id":"2510.12523","title":"Multi-Armed Bandits with Minimum Aggregated Revenue Constraints","created":"2025-10-14","cited_by_count":0,"area":null},{"id":"2603.07005","title":"Combinatorial Allocation Bandits with Nonlinear Arm Utility","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2604.24810","title":"A Comparative Analysis on the Performance of Upper Confidence Bound Algorithms in Adaptive Deep Neural Networks","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.12176","title":"Multi-Task Representation Learning for Conservative Linear Bandits","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2608.11383","title":"Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}