{"total":39,"rows":[{"id":"2302.01523","title":"Multi-channel Autobidding with Budget and ROI Constraints","created":"2023-02-03","cited_by_count":14,"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":"2304.14326","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","created":"2023-04-27","cited_by_count":9,"area":null},{"id":"2304.05219","title":"BanditQ: Fair Bandits with Guaranteed Rewards","created":"2023-04-11","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":"2302.01203","title":"Online Learning under Budget and ROI Constraints via Weak Adaptivity","created":"2023-02-02","cited_by_count":5,"area":null},{"id":"2402.08799","title":"Projection-Free Online Convex Optimization with Time-Varying Constraints","created":"2024-02-13","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":"2312.16267","title":"Maximizing the Success Probability of Policy Allocations in Online Systems","created":"2023-12-26","cited_by_count":4,"area":null},{"id":"2403.06812","title":"Monotone Individual Fairness","created":"2024-03-11","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":"2305.01333","title":"Projection-Free Online Convex Optimization with Stochastic Constraints","created":"2023-05-02","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":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","cited_by_count":2,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2509.11357","title":"Online Omniprediction with Long-Term Constraints","created":"2025-09-14","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":"2602.14580","title":"Replicable Constrained Bandits","created":"2026-02-16","cited_by_count":2,"area":null},{"id":"2606.08028","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","created":"2026-06-06","cited_by_count":2,"area":null},{"id":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2403.05786","title":"Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints","created":"2024-03-09","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":"2508.16992","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","created":"2025-08-23","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":"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":"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":"2311.02426","title":"Online Non-convex Optimization with Long-term Non-convex Constraints","created":"2023-11-04","cited_by_count":0,"area":null},{"id":"2411.04295","title":"Fairness with Exponential Weights","created":"2024-11-06","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":"2509.16324","title":"Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2510.07266","title":"Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints","created":"2025-10-08","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.10475","title":"Regret Minimization in Bilateral Trade With Perturbed Markets","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.10572","title":"Online Sharp-Calibrated Bayesian Optimization","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.28133","title":"Learning to Bid in Repeated Second-Price Auctions with Dynamic Values and Aggregated Feedback","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.18679","title":"Fair Online Resource Allocation","created":"2026-06-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}