online algorithm

Delegated Online Search IJCAI 2023 Discrete-Smoothness in Online Algorithms with Predictions NeurIPS 2023 Dynamical Linear Bandits ICML 2023 Dynamic Pricing and Learning with Bayesian Persuasion NeurIPS 2023 Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract) AAAI 2023 Efficient Online Clustering with Moving Costs NeurIPS 2023 Energy-Efficient Scheduling with Predictions NeurIPS 2023 Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023 Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization COLT 2023 High-dimensional Contextual Bandit Problem without Sparsity NeurIPS 2023 Learning and Collusion in Multi-unit Auctions NeurIPS 2023 Learning-Augmented Algorithms for Online TSP on the Line AAAI 2023 Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023 Mixing Predictions for Online Metric Algorithms ICML 2023 Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NeurIPS 2023 Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests ICML 2023 Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback ICML 2023 One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023 Online Ad Allocation with Predictions NeurIPS 2023 Online Algorithms with Costly Predictions AISTATS 2023 Online k-means Clustering on Arbitrary Data Streams ALT 2023 Online List Labeling with Predictions NeurIPS 2023 Online Mechanism Design for Information Acquisition ICML 2023