Online Algorithms

Linear-Time Optimal Deadlock Detection for Efficient Scheduling in Multi-Track Railway Networks IJCAI 2024 Local and Adaptive Mirror Descents in Extensive-Form Games NeurIPS 2024 Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit NeurIPS 2024 Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs NeurIPS 2024 Locally Private and Robust Multi-Armed Bandits NeurIPS 2024 Lookback Prophet Inequalities NeurIPS 2024 Low-rank Matrix Bandits with Heavy-tailed Rewards UAI 2024 Matroid Semi-Bandits in Sublinear Time ICML 2024 Maximizing utility in multi-agent environments by anticipating the behavior of other learners NeurIPS 2024 Mechanisms That Play a Game, Not Toss a Coin IJCAI 2024 Metric Clustering and MST with Strong and Weak Distance Oracles COLT 2024 Metric Distortion with Elicited Pairwise Comparisons IJCAI 2024 Monoculture in Matching Markets NeurIPS 2024 Monotone Individual Fairness ICML 2024 Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels AISTATS 2024 Multi-agent coverage control with transient behavior consideration L4DC 2024 Multi-armed bandits with guaranteed revenue per arm AISTATS 2024 Multiclass Online Learnability under Bandit Feedback ALT 2024 Multiclass Transductive Online Learning NeurIPS 2024 Multiobjective Lipschitz Bandits under Lexicographic Ordering AAAI 2024 Mutli-Armed Bandits with Network Interference NeurIPS 2024 Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning ICML 2024 Nearly Minimax Optimal Regret for Multinomial Logistic Bandit NeurIPS 2024 Nearly Optimal Regret for Decentralized Online Convex Optimization COLT 2024 Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NeurIPS 2024