{"total":82,"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":"2203.15589","title":"On Kernelized Multi-Armed Bandits with Constraints","created":"2022-03-29","cited_by_count":23,"area":null},{"id":"2402.15776","title":"Truly No-Regret Learning in Constrained MDPs","created":"2024-02-24","cited_by_count":23,"area":"deeprl"},{"id":"2506.17670","title":"Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution","created":"2025-06-21","cited_by_count":19,"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":"2312.08511","title":"The Relative Value of Prediction in Algorithmic Decision Making","created":"2023-12-13","cited_by_count":14,"area":null},{"id":"2510.26706","title":"Budgeted Multiple-Expert Deferral","created":"2025-10-30","cited_by_count":13,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"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":"2209.12013","title":"Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem","created":"2022-09-24","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":"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":"2404.09832","title":"No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints","created":"2024-04-15","cited_by_count":9,"area":null},{"id":"2604.14853","title":"Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization","created":"2026-04-16","cited_by_count":9,"area":"lr"},{"id":"2104.09750","title":"Joint Online Learning and Decision-making via Dual Mirror Descent","created":"2021-04-20","cited_by_count":8,"area":null},{"id":"2308.15006","title":"Directional Optimism for Safe Linear Bandits","created":"2023-08-29","cited_by_count":8,"area":null},{"id":"2305.19158","title":"Competing for Shareable Arms in Multi-Player Multi-Armed Bandits","created":"2023-05-30","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":"2204.11910","title":"Integrating Reward Maximization and Population Estimation: Sequential Decision-Making for Internal Revenue Service Audit Selection","created":"2022-04-25","cited_by_count":5,"area":null},{"id":"2306.00096","title":"Learning the Pareto Front Using Bootstrapped Observation Samples","created":"2023-05-31","cited_by_count":5,"area":null},{"id":"2402.18591","title":"Stochastic contextual bandits with graph feedback: from independence number to MAS number","created":"2024-02-12","cited_by_count":5,"area":null},{"id":"2407.01458","title":"Contractual Reinforcement Learning: Pulling Arms with Invisible Hands","created":"2024-07-01","cited_by_count":5,"area":"deeprl"},{"id":"2409.20489","title":"Online Decision Deferral under Budget Constraints","created":"2024-09-30","cited_by_count":5,"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":"2604.00136","title":"ParetoBandit: Budget-Paced Adaptive Routing for Non-Stationary LLM Serving","created":"2026-03-31","cited_by_count":4,"area":null},{"id":"2106.03356","title":"DMBGN: Deep Multi-Behavior Graph Networks for Voucher Redemption Rate Prediction","created":"2021-06-07","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":"2207.11159","title":"Network Revenue Management with Demand Learning and Fair Resource-Consumption Balancing","created":"2022-07-22","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":"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":"2402.19090","title":"Best Arm Identification with Resource Constraints","created":"2024-02-29","cited_by_count":3,"area":null},{"id":"2406.15648","title":"Testing the Feasibility of Linear Programs with Bandit Feedback","created":"2024-06-21","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":"2509.25777","title":"Online Decision Making with Generative Action Sets","created":"2025-09-30","cited_by_count":3,"area":null},{"id":"2105.09295","title":"Online Selection of Diverse Committees","created":"2021-05-19","cited_by_count":2,"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":"2301.13791","title":"Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback","created":"2023-01-31","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":"2305.19605","title":"Parameter-free projected gradient descent","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2306.13440","title":"Trading-off price for data quality to achieve fair online allocation","created":"2023-06-23","cited_by_count":2,"area":null},{"id":"2404.04467","title":"Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management","created":"2024-04-06","cited_by_count":2,"area":null},{"id":"2409.00561","title":"Multi-Task Combinatorial Bandits for Budget Allocation","created":"2024-08-31","cited_by_count":2,"area":null},{"id":"2410.09597","title":"A Complete Characterization of Learnability for Stochastic Noisy Bandits","created":"2024-10-12","cited_by_count":2,"area":null},{"id":"2603.06403","title":"Adapter-Augmented Bandits for Online Multi-Constrained Multi-Modal Inference Scheduling","created":"2026-03-06","cited_by_count":2,"area":"mllm"},{"id":"2103.12833","title":"Online Learning in Budget-Constrained Dynamic Colonel Blotto Games","created":"2021-03-23","cited_by_count":1,"area":null},{"id":"2212.06891","title":"Interactive Learning with Pricing for Optimal and Stable Allocations in Markets","created":"2022-12-13","cited_by_count":1,"area":null},{"id":"2412.02934","title":"BGTplanner: Maximizing Training Accuracy for Differentially Private Federated Recommenders via Strategic Privacy Budget Allocation","created":"2024-12-04","cited_by_count":1,"area":null},{"id":"2503.00650","title":"The Hidden Cost of Waiting for Accurate Predictions","created":"2025-03-01","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":"2603.18702","title":"Off-Policy Learning with Limited Supply","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2604.12497","title":"Allocating Human Oversight in AI-Enabled Analytics","created":"2026-04-14","cited_by_count":1,"area":null},{"id":"2605.09448","title":"Learning to Bid with Unknown Private Values in Budget-Constrained First-Price Auctions","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2609.05820","title":"Online Learning with LLM Experts from Limited Feedback","created":"2026-09-05","cited_by_count":1,"area":null},{"id":"2107.05289","title":"Continuous Time Bandits With Sampling Costs","created":"2021-07-12","cited_by_count":0,"area":null},{"id":"2306.16578","title":"Allocating Divisible Resources on Arms with Unknown and Random Rewards","created":"2023-06-28","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":"2401.16945","title":"Online Resource Allocation with Non-Stationary Customers","created":"2024-01-30","cited_by_count":0,"area":null},{"id":"2403.15524","title":"PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators","created":"2024-03-22","cited_by_count":0,"area":null},{"id":"2404.13391","title":"Online Planning of Power Flows for Power Systems Against Bushfires Using Spatial Context","created":"2024-04-20","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":"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":"2501.18560","title":"Bandits with Anytime Knapsacks","created":"2025-01-30","cited_by_count":0,"area":null},{"id":"2503.02043","title":"Constrained Linear Thompson Sampling","created":"2025-03-03","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":"2602.05019","title":"A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2602.24146","title":"Learning with a Budget: Identifying the Best Arm with Resource Constraints","created":"2026-02-27","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.20024","title":"Replicable Bandits with UCB based Exploration","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2607.05620","title":"Safe Bayesian Optimization with Counterfactual Policies","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2608.01341","title":"402Pilot: An x402 Decision Layer for Autonomous Agent Micropayments","created":"2026-08-02","cited_by_count":0,"area":null},{"id":"2608.04669","title":"Differentiating Through Dual Prices: End-to-End Policy Learning Under Capacity Constraints","created":"2026-08-05","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}