online algorithm

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NeurIPS 2021 Follow-the-Regularized-Leader Routes to Chaos in Routing Games ICML 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 Fully Gap-Dependent Bounds for Multinomial Logit Bandit AISTATS 2021 Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NeurIPS 2021 Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021 Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds NeurIPS 2021 Learning Augmented Methods for Matching: Improving Invasive Species Management and Urban Mobility AAAI 2021 Learning Online Algorithms with Distributional Advice ICML 2021 Leveraging Good Representations in Linear Contextual Bandits ICML 2021 Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021 Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021 Necessarily Optimal One-Sided Matchings AAAI 2021 Non-Parametric Stochastic Sequential Assignment With Random Arrival Times IJCAI 2021 No-substitution k-means Clustering with Adversarial Order ALT 2021 On a Competitive Secretary Problem with Deferred Selections IJCAI 2021 Online A-Optimal Design and Active Linear Regression ICML 2021 Online Blind Audio Source Separation Using Recursive Expectation-Maximization Interspeech 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Online Learning from Optimal Actions COLT 2021 Online Market Equilibrium with Application to Fair Division NeurIPS 2021 Online Non-Monotone DR-Submodular Maximization AAAI 2021 Online Posted Pricing with Unknown Time-Discounted Valuations AAAI 2021 Online Risk-Averse Submodular Maximization IJCAI 2021 Online Selection Problems against Constrained Adversary ICML 2021