{"total":72,"rows":[{"id":"2209.07454","title":"A Unifying Framework for Online Optimization with Long-Term Constraints","created":"2022-09-15","cited_by_count":41,"area":null},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"area":null},{"id":"2108.08843","title":"Learning Equilibria in Matching Markets from Bandit Feedback","created":"2021-08-19","cited_by_count":34,"area":null},{"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":"2103.10246","title":"Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising","created":"2021-03-16","cited_by_count":25,"area":null},{"id":"2205.12427","title":"Non-stationary Bandits with Knapsacks","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2205.15372","title":"Optimistic Whittle Index Policy: Online Learning for Restless Bandits","created":"2022-05-30","cited_by_count":20,"area":null},{"id":"2301.13306","title":"Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics","created":"2023-01-30","cited_by_count":20,"area":null},{"id":"2208.13713","title":"Online Bidding Algorithms for Return-on-Spend Constrained Advertisers","created":"2022-08-29","cited_by_count":17,"area":null},{"id":"2310.12370","title":"No-Regret Learning in Bilateral Trade via Global Budget Balance","created":"2023-10-18","cited_by_count":17,"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":"2210.06846","title":"An $\\alpha$-regret analysis of Adversarial Bilateral Trade","created":"2022-10-13","cited_by_count":16,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","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":"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":"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":"2104.09750","title":"Joint Online Learning and Decision-making via Dual Mirror Descent","created":"2021-04-20","cited_by_count":8,"area":null},{"id":"2208.09254","title":"Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits","created":"2022-08-19","cited_by_count":8,"area":null},{"id":"2302.14686","title":"Approximately Stationary Bandits with Knapsacks","created":"2023-02-28","cited_by_count":6,"area":null},{"id":"2306.03655","title":"Online Learning under Adversarial Nonlinear Constraints","created":"2023-06-06","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":"2202.06694","title":"Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2312.12794","title":"Bandit Sequential Posted Pricing via Half-Concavity","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2409.20489","title":"Online Decision Deferral under Budget Constraints","created":"2024-09-30","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":"2201.02890","title":"Lazy Lagrangians with Predictions for Online Learning","created":"2022-01-08","cited_by_count":4,"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":"2206.03019","title":"The Survival Bandit Problem","created":"2022-06-07","cited_by_count":4,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","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":"2306.10050","title":"Interpolating Item and User Fairness in Multi-Sided Recommendations","created":"2023-06-12","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":"2503.14796","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","created":"2025-03-19","cited_by_count":3,"area":null},{"id":"2505.02963","title":"Single-Sample and Robust Online Resource Allocation","created":"2025-05-05","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":"2106.01135","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","created":"2021-06-02","cited_by_count":2,"area":null},{"id":"2202.12872","title":"AutoFR: Automated Filter Rule Generation for Adblocking","created":"2022-02-25","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":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","cited_by_count":2,"area":null},{"id":"2510.02820","title":"Online Learning in the Random Order Model","created":"2025-10-03","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":"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":"2507.06859","title":"Episodic Contextual Bandits with Knapsacks under Conversion Models","created":"2025-07-09","cited_by_count":1,"area":null},{"id":"2510.22579","title":"Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2025-10-26","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":"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":"2605.12111","title":"Adaptive Multi-Round Allocation with Stochastic Arrivals","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2106.07752","title":"Optimization-friendly generic mechanisms without money","created":"2021-06-14","cited_by_count":0,"area":null},{"id":"2107.05289","title":"Continuous Time Bandits With Sampling Costs","created":"2021-07-12","cited_by_count":0,"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":"2302.03784","title":"Leveraging User-Triggered Supervision in Contextual Bandits","created":"2023-02-07","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":"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":"2501.18560","title":"Bandits with Anytime Knapsacks","created":"2025-01-30","cited_by_count":0,"area":null},{"id":"2502.05599","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","created":"2025-02-08","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2605.06190","title":"Constrained Contextual Bandits with Adversarial Contexts","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.14953","title":"Efficient Online Conformal Selection with Limited Feedback","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2606.00846","title":"CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM","created":"2026-05-30","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},{"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},{"id":"2609.06921","title":"Constrained Online Learning with Noisy Constraint Values","created":"2026-09-07","cited_by_count":0,"area":null}],"next_cursor":null}