{"total":43,"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":"2102.06385","title":"The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks","created":"2021-02-12","cited_by_count":16,"area":null},{"id":"2209.13694","title":"Safe Linear Bandits over Unknown Polytopes","created":"2022-09-27","cited_by_count":14,"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":"2303.06396","title":"No-regret Algorithms for Fair Resource Allocation","created":"2023-03-11","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":"2110.10081","title":"Stateful Offline Contextual Policy Evaluation and Learning","created":"2021-10-19","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":"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":"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":"2312.17229","title":"Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources","created":"2023-12-28","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":"2207.04690","title":"Dynamic Budget Throttling in Repeated Second-Price Auctions","created":"2022-07-11","cited_by_count":2,"area":null},{"id":"2210.09957","title":"Contextual bandits with concave rewards, and an application to fair ranking","created":"2022-10-18","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":"2310.19025","title":"An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits","created":"2023-10-29","cited_by_count":2,"area":null},{"id":"2103.12833","title":"Online Learning in Budget-Constrained Dynamic Colonel Blotto Games","created":"2021-03-23","cited_by_count":1,"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":"2303.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2507.06859","title":"Episodic Contextual Bandits with Knapsacks under Conversion Models","created":"2025-07-09","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":"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":"2112.14941","title":"A General Traffic Shaping Protocol in E-Commerce","created":"2021-12-30","cited_by_count":0,"area":null},{"id":"2304.13033","title":"SmartChoices: Augmenting Software with Learned Implementations","created":"2023-04-12","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":"2401.16945","title":"Online Resource Allocation with Non-Stationary Customers","created":"2024-01-30","cited_by_count":0,"area":null},{"id":"2410.18844","title":"Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints","created":"2024-10-24","cited_by_count":0,"area":null},{"id":"2510.12447","title":"Bayesian Optimization for Dynamic Pricing and Learning","created":"2025-10-14","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":"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},{"id":"2608.11383","title":"Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.16375","title":"Multinomial Subset Routing with Sum-Max Rewards and Operational Constraints","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}