Multi-Armed Bandits

Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions AAAI 2021 Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions COLT 2021 CORe: Capitalizing On Rewards in Bandit Exploration UAI 2021 Coupon Design in Advertising Systems AAAI 2021 DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021 Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NeurIPS 2021 Decentralized Multi-Agent Linear Bandits with Safety Constraints AAAI 2021 Deep Bandits Show-Off: Simple and Efficient Exploration with Deep Networks NeurIPS 2021 Design of Experiments for Stochastic Contextual Linear Bandits NeurIPS 2021 Differentially Private Multi-Armed Bandits in the Shuffle Model NeurIPS 2021 Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021 Doubly Robust Thompson Sampling with Linear Payoffs NeurIPS 2021 Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021 Dueling Bandits with Team Comparisons NeurIPS 2021 Dueling Convex Optimization ICML 2021 Dynamic Balancing for Model Selection in Bandits and RL ICML 2021 Dynamic Planning and Learning under Recovering Rewards ICML 2021 Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NeurIPS 2021 Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure AAAI 2021 Epsilon Best Arm Identification in Spectral Bandits IJCAI 2021 Fair Exploration via Axiomatic Bargaining NeurIPS 2021 Fairness of Exposure in Stochastic Bandits ICML 2021 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021 Fast Rate Learning in Stochastic First Price Bidding ACML 2021 Federated Linear Contextual Bandits NeurIPS 2021