{"total":28,"rows":[{"id":"2108.08993","title":"Distributionally Robust Learning","created":"2021-08-20","cited_by_count":44,"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":"2203.15589","title":"On Kernelized Multi-Armed Bandits with Constraints","created":"2022-03-29","cited_by_count":23,"area":null},{"id":"2107.11911","title":"Restless Bandits with Many Arms: Beating the Central Limit Theorem","created":"2021-07-25","cited_by_count":18,"area":null},{"id":"2202.13234","title":"Safe Exploration for Efficient Policy Evaluation and Comparison","created":"2022-02-26","cited_by_count":15,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","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":"2209.00399","title":"Optimal Regularized Online Allocation by Adaptive Re-Solving","created":"2022-09-01","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":"2110.14621","title":"Fairer LP-based Online Allocation via Analytic Center","created":"2021-10-27","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":"2309.08709","title":"Price of Safety in Linear Best Arm Identification","created":"2023-09-15","cited_by_count":4,"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":"2607.23765","title":"WISERouter: LLM Routing with Workload Budget Constraint","created":"2026-07-26","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":"2211.03240","title":"Spatio-temporal Incentives Optimization for Ride-hailing Services with Offline Deep Reinforcement Learning","created":"2022-11-06","cited_by_count":2,"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":"2407.05564","title":"A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints","created":"2024-07-08","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":"2505.07101","title":"Constrained Online Decision-Making: A Unified Framework","created":"2025-05-11","cited_by_count":1,"area":null},{"id":"2302.03784","title":"Leveraging User-Triggered Supervision in Contextual Bandits","created":"2023-02-07","cited_by_count":0,"area":null},{"id":"2305.00254","title":"Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning","created":"2023-04-29","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":"2405.11417","title":"Budgeted Recommendation with Delayed Feedback","created":"2024-05-19","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":"2605.12176","title":"Multi-Task Representation Learning for Conservative Linear Bandits","created":"2026-05-12","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}],"next_cursor":null}