← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022
Multi-robot Task Allocation in the Environment with Functional Tasks IJCAI 2022
Online Active Regression ICML 2022
Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk ICML 2022
Sequential Vaccine Allocation with Delayed Feedback IJCAI 2022
The Two-Sided Game of Googol JMLR 2022
A Reliability-aware Distributed Framework to Schedule Residential Charging of Electric Vehicles IJCAI 2022
Efficient Resource Allocation with Secretive Agents IJCAI 2022
Selling Data To a Machine Learner: Pricing via Costly Signaling ICML 2022
Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit IJCAI 2022
Bayesian Change-Point Detection for Bandit Feedback in Non-stationary Environments ACML 2022
Dynamic Bandits with Temporal Structure IJCAI 2022
Online Page Migration with ML Advice AISTATS 2022
Scheduling with Untrusted Predictions IJCAI 2022
Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022
Online Algorithms for the Santa Claus Problem NIPS 2022
Minimax Regret for Cascading Bandits NIPS 2022
Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability NIPS 2022
Tracking Most Significant Arm Switches in Bandits COLT 2022
Product Ranking for Revenue Maximization with Multiple Purchases NIPS 2022
Dynamic Learning in Large Matching Markets NIPS 2022
Online Competitive Influence Maximization AISTATS 2022
Algorithms with Prediction Portfolios NIPS 2022
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022
Dynamic Fair Division with Partial Information NIPS 2022