Online Algorithms

Real-Time Driver-Request Assignment in Ridesourcing AAAI 2022 Recruitment Strategies That Take a Chance NeurIPS 2022 Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022 Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022 Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022 Rotting Infinitely Many-Armed Bandits ICML 2022 Runtime Programmable Switches NSDI 2022 Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022 Safe Opponent-Exploitation Subgame Refinement NeurIPS 2022 Safe Subgame Resolving for Extensive Form Correlated Equilibrium AAAI 2022 Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search NeurIPS 2022 Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022 Scalable and Efficient Non-adaptive Deterministic Group Testing NeurIPS 2022 Scale-Free Adversarial Multi Armed Bandits ALT 2022 Scale-free Unconstrained Online Learning for Curved Losses COLT 2022 Scheduling with Untrusted Predictions IJCAI 2022 Secretary Matching with Vertex Arrivals and No Rejections AAAI 2022 Selling Data To a Machine Learner: Pricing via Costly Signaling ICML 2022 Sequential Blocked Matching AAAI 2022 Sequential Information Design: Learning to Persuade in the Dark NeurIPS 2022 Sequential Vaccine Allocation with Delayed Feedback IJCAI 2022 Shrub Ensembles for Online Classification AAAI 2022 Signaling in Posted Price Auctions AAAI 2022 Simple and Optimal Greedy Online Contention Resolution Schemes NeurIPS 2022 Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions NeurIPS 2022