competitive ratio

Online Sampling and Decision Making with Low Entropy IJCAI 2024 Online Submodular Maximization via Adaptive Thresholds IJCAI 2024 Online Weighted Paging with Unknown Weights NeurIPS 2024 Parameter-Dependent Competitive Analysis for Online Capacitated Coverage Maximization through Boostings and Attenuations ICML 2024 Piecewise-Stationary Bandits with Knapsacks NeurIPS 2024 Risk-Sensitive Online Algorithms (Extended Abstract) COLT 2024 Sampling for Beyond-Worst-Case Online Ranking AAAI 2024 The Secretary Problem with Predicted Additive Gap NeurIPS 2024 A Bayesian approach for bandit online optimization with switching cost UAI 2023 Approximately Stationary Bandits with Knapsacks COLT 2023 Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023 Energy-Efficient Scheduling with Predictions NeurIPS 2023 Learning-Augmented Algorithms for Online TSP on the Line AAAI 2023 Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees ICML 2023 Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits IJCAI 2023 Mixing Predictions for Online Metric Algorithms ICML 2023 Multi-agent Online Scheduling: MMS Allocations for Indivisible Items ICML 2023 Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests ICML 2023 Online Ad Allocation with Predictions NeurIPS 2023 Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems ALT 2023 Random Cuts are Optimal for Explainable k-Medians NeurIPS 2023 Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary ICML 2023 Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022 Decentralized Online Convex Optimization in Networked Systems ICML 2022 Learning-Augmented Algorithms for Online Steiner Tree AAAI 2022