Online Algorithms

Time-Constrained Participatory Budgeting Under Uncertain Project Costs IJCAI 2022 Top Two Algorithms Revisited NeurIPS 2022 Towards Controlling the Transmission of Diseases: Continuous Exposure Discovery over Massive-Scale Moving Objects IJCAI 2022 Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information COLT 2022 Tracking Most Significant Arm Switches in Bandits COLT 2022 Tractable Optimality in Episodic Latent MABs NeurIPS 2022 Training Subset Selection for Weak Supervision NeurIPS 2022 Traversing Supervisor Problem: An Approximately Optimal Approach to Multi-Robot Assistance RSS 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NeurIPS 2022 UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022 Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022 Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022 Uplifting Bandits NeurIPS 2022 Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022 Yeti: Stateless and Generalized Multicast Forwarding NSDI 2022 LeadCache: Regret-Optimal Caching in Networks NeurIPS 2021 A/B/n Testing with Control in the Presence of Subpopulations NeurIPS 2021 Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021 A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NeurIPS 2021 Adapting to Delays and Data in Adversarial Multi-Armed Bandits ICML 2021 Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021 Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium COLT 2021 ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks ICML 2021 Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021 Adversarial Dueling Bandits ICML 2021