online algorithm

Continual Counting with Gradual Privacy Expiration NeurIPS 2024 Contract Scheduling with Distributional and Multiple Advice IJCAI 2024 Data-Driven Online Model Selection With Regret Guarantees AISTATS 2024 Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024 Efficient Online Crowdsourcing with Complex Annotations AAAI 2024 Ensemble sampling for linear bandits: small ensembles suffice NeurIPS 2024 Fair Online Bilateral Trade NeurIPS 2024 Fair Secretaries with Unfair Predictions NeurIPS 2024 Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm ICML 2024 Horus: Granular In-Network Task Scheduler for Cloud Datacenters NSDI 2024 How Does Variance Shape the Regret in Contextual Bandits? NeurIPS 2024 Improved Approximation of Weighted MMS Fairness for Indivisible Chores IJCAI 2024 Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility AAAI 2024 Improved Regret for Bandit Convex Optimization with Delayed Feedback NeurIPS 2024 Learning-Augmented Algorithms for the Bahncard Problem NeurIPS 2024 Learning-Augmented Algorithms with Explicit Predictors NeurIPS 2024 Learning-Augmented Dynamic Submodular Maximization NeurIPS 2024 Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem AAAI 2024 Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms NeurIPS 2024 Learning with Posterior Sampling for Revenue Management under Time-varying Demand IJCAI 2024 Local and Adaptive Mirror Descents in Extensive-Form Games NeurIPS 2024 Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs NeurIPS 2024 Lookback Prophet Inequalities NeurIPS 2024 MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation ICML 2024 Metric Distortion with Elicited Pairwise Comparisons IJCAI 2024