Online Algorithms

Decentralized Exploration in Multi-Armed Bandits ICML 2019 Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards NeurIPS 2019 Dying Experts: Efficient Algorithms with Optimal Regret Bounds NeurIPS 2019 Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NeurIPS 2019 Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem ICML 2019 Dynamic Pricing in High-dimensions JMLR 2019 Dynamic Vehicle Traffic Control Using Deep Reinforcement Learning in Automated Material Handling System AAAI 2019 Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019 Efficient and Thrifty Voting by Any Means Necessary NeurIPS 2019 Efficient Linear Bandits through Matrix Sketching AISTATS 2019 Efficient Online Learning for Mapping Kernels on Linguistic Structures AAAI 2019 Efficient Pure Exploration in Adaptive Round model NeurIPS 2019 Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium NeurIPS 2019 Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm AAAI 2019 Equal Opportunity in Online Classification with Partial Feedback NeurIPS 2019 Equipping Experts/Bandits with Long-term Memory NeurIPS 2019 Equitable Stable Matchings in Quadratic Time NeurIPS 2019 Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging IJCAI 2019 Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NeurIPS 2019 FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms ACL 2019 Finding the bandit in a graph: Sequential search-and-stop AISTATS 2019 Fully Dynamic Consistent Facility Location NeurIPS 2019 GSLAM: A General SLAM Framework and Benchmark ICCV 2019 How to Tame Your Anticipatory Algorithm IJCAI 2019 Improved Path-length Regret Bounds for Bandits COLT 2019