{"total":65,"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":"2106.05135","title":"Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints","created":"2021-06-09","cited_by_count":39,"area":null},{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2205.12427","title":"Non-stationary Bandits with Knapsacks","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2102.03192","title":"Provably Efficient Algorithms for Multi-Objective Competitive RL","created":"2021-02-05","cited_by_count":22,"area":null},{"id":"2105.00321","title":"Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization","created":"2021-05-01","cited_by_count":21,"area":null},{"id":"2108.09435","title":"Fairness-Aware Online Meta-learning","created":"2021-08-21","cited_by_count":19,"area":null},{"id":"2205.11264","title":"Adaptive Fairness-Aware Online Meta-Learning for Changing Environments","created":"2022-05-20","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":"2306.00149","title":"Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2111.07707","title":"Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints","created":"2021-11-15","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":"2210.11834","title":"Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles","created":"2022-10-21","cited_by_count":12,"area":null},{"id":"2306.01007","title":"Towards Fair Disentangled Online Learning for Changing Environments","created":"2023-05-31","cited_by_count":11,"area":null},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"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":"2103.11370","title":"Online Convex Optimization with Continuous Switching Constraint","created":"2021-03-21","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":"2206.04475","title":"Individually Fair Learning with One-Sided Feedback","created":"2022-06-09","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":"2501.16046","title":"Revisiting Projection-Free Online Learning with Time-Varying Constraints","created":"2025-01-27","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":"2605.21107","title":"A Geometric Approach to Constrained Online Learning","created":"2026-05-20","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":"2203.17150","title":"Online Learning for Traffic Routing under Unknown Preferences","created":"2022-03-31","cited_by_count":4,"area":null},{"id":"2302.12320","title":"Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems","created":"2023-02-23","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":"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":"2603.20671","title":"Breaking the $O(\\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\\sqrt{T})$ Static Regret in Constrained Online Convex Optimization","created":"2026-03-21","cited_by_count":3,"area":null},{"id":"2105.04005","title":"Delay-Tolerant Constrained OCO with Application to Network Resource Allocation","created":"2021-05-09","cited_by_count":2,"area":null},{"id":"2106.04944","title":"Non-Parametric Stochastic Sequential Assignment With Random Arrival Times","created":"2021-06-09","cited_by_count":2,"area":null},{"id":"2205.00825","title":"Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements","created":"2022-04-27","cited_by_count":2,"area":null},{"id":"2210.16735","title":"Online Convex Optimization with Long Term Constraints for Predictable Sequences","created":"2022-10-30","cited_by_count":2,"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":"2402.12319","title":"Dynamic Environment Responsive Online Meta-Learning with Fairness Awareness","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2403.04033","title":"Online Learning with Unknown Constraints","created":"2024-03-06","cited_by_count":2,"area":null},{"id":"2412.10703","title":"Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint","created":"2024-12-14","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":"2606.08028","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","created":"2026-06-06","cited_by_count":2,"area":null},{"id":"2606.31480","title":"Constrained Online Convex Optimization without Slater's Condition","created":"2026-06-30","cited_by_count":2,"area":null},{"id":"2301.11267","title":"Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedback","created":"2023-01-26","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":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2307.06048","title":"Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization","created":"2023-07-12","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.09296","title":"Tight Bounds for Online Convex Optimization with Adversarial Constraints","created":"2024-05-15","cited_by_count":1,"area":null},{"id":"2405.19015","title":"Distributed Management of Fluctuating Energy Resources in Dynamic Networked Systems","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2408.07831","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","created":"2024-08-14","cited_by_count":1,"area":null},{"id":"2505.00398","title":"Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints","created":"2025-05-01","cited_by_count":1,"area":null},{"id":"2204.02197","title":"Penalised FTRL With Time-Varying Constraints","created":"2022-04-05","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":"2310.10946","title":"Multi-point Feedback of Bandit Convex Optimization with Hard Constraints","created":"2023-10-17","cited_by_count":0,"area":null},{"id":"2503.13366","title":"Optimal Bounds for Adversarial Constrained Online Convex Optimization","created":"2025-03-17","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":"2509.05930","title":"Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms","created":"2025-09-07","cited_by_count":0,"area":null},{"id":"2510.13560","title":"Multi-Objective $\\textit{min-max}$ Online Convex Optimization","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2601.16072","title":"CLASP: An online learning algorithm for Convex Losses And Squared Penalties","created":"2026-01-22","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":"2606.10187","title":"Decision-Calibrated Conformal Uncertainty for Pacing Decisions in Streaming Advertising","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2607.10808","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2607.25480","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","created":"2026-07-28","cited_by_count":0,"area":null},{"id":"2607.27626","title":"Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning","created":"2026-07-30","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},{"id":"2610.01377","title":"Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}