← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

PAC Battling Bandits in the Plackett-Luce Model ALT 2019
Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer NIPS 2019
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NIPS 2019
Equitable Stable Matchings in Quadratic Time NIPS 2019
Prior-Free Dynamic Auctions with Low Regret Buyers NIPS 2019
Secretary Ranking with Minimal Inversions NIPS 2019
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NIPS 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking NIPS 2019
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits NIPS 2019
Ultra Fast Medoid Identification via Correlated Sequential Halving NIPS 2019
Adaptive Influence Maximization with Myopic Feedback NIPS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Linear Stochastic Bandits Under Safety Constraints NIPS 2019
Efficient Pure Exploration in Adaptive Round model NIPS 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis NIPS 2019
Learning Multiple Markov Chains via Adaptive Allocation NIPS 2019
Decentralized Cooperative Stochastic Bandits NIPS 2019
Blocking Bandits NIPS 2019
Sequential Experimental Design for Transductive Linear Bandits NIPS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function NIPS 2019
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NIPS 2019
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback NIPS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Making the Cut: A Bandit-based Approach to Tiered Interviewing NIPS 2019