← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

p-Mean Regret for Stochastic Bandits AAAI 2025
Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback AAAI 2025
List Update with Prediction AAAI 2025
Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025
Strategyproof Matching of Roommates and Rooms AAAI 2025
Optimal Bounds for Dissatisfaction in Perpetual Voting AAAI 2025
Scalable Decentralized Algorithms for Online Personalized Mean Estimation AAAI 2025
On the Power of Optimism in Constrained Online Convex Optimization IJCAI 2025
MATWA: A Web Toolkit for Matching Under Preferences AAAI 2025
App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation IJCAI 2025
Decentralized Online Learning by Selfish Agents in Coalition Formation IJCAI 2025
EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025
Gradient Equilibrium in Online Learning: Theory and Applications JMLR 2025
Mixture of Online and Offline Experts for Non-Stationary Time Series AAAI 2025
Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach AAAI 2025
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs JMLR 2025
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025
Universal Online Convex Optimization Meets Second-order Bounds JMLR 2025
Online Quantile Regression JMLR 2025
Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025
Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback JMLR 2025
Efficient Algorithms for Electing Successive Committees IJCAI 2025
Online Learning of Coalition Structures by Selfish Agents AAAI 2025
Forecasting Competitions with Correlated Events AAAI 2025
Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025