← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Algorithms for the Santa Claus Problem NIPS 2022
Approximate Function Evaluation via Multi-Armed Bandits AISTATS 2022
Thompson Sampling with a Mixture Prior AISTATS 2022
Minimax Regret for Cascading Bandits NIPS 2022
Sliding-Seeking Control: Model-Free Optimization with Safety Constraints L4DC 2022
Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability NIPS 2022
Distributed Learning with Strategic Users: A Repeated Game Approach AAAI 2022
Product Ranking for Revenue Maximization with Multiple Purchases NIPS 2022
Dynamic Learning in Large Matching Markets NIPS 2022
Equity Promotion in Online Resource Allocation AAAI 2022
Algorithms with Prediction Portfolios NIPS 2022
Dynamic Fair Division with Partial Information NIPS 2022
Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NIPS 2022
Maximizing Revenue under Market Shrinkage and Market Uncertainty NIPS 2022
Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information L4DC 2022
Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems NIPS 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach AAAI 2022
Oracle-Efficient Online Learning for Smoothed Adversaries NIPS 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NIPS 2022
Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022
Learning Predictions for Algorithms with Predictions NIPS 2022
Dynamic pricing and assortment under a contextual MNL demand NIPS 2022
Online Allocation and Learning in the Presence of Strategic Agents NIPS 2022
Best Arm Identification with Safety Constraints AISTATS 2022
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search NIPS 2022