Tight Lower Bounds for Combinatorial Multi-Armed Bandits

v1v2v3 (latest)

Tight Lower Bounds for Combinatorial Multi-Armed Bandits

13 February 2020

ArXiv (abs)PDF HTML

Papers citing "Tight Lower Bounds for Combinatorial Multi-Armed Bandits"

8 / 8 papers shown

Title
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference Fateme Jamshidi Mohammad Shahverdikondori Negar Kiyavash 56 1 0 10 Mar 2025
Allocating Divisible Resources on Arms with Unknown and Random Rewards Ningyuan Chen Wenhao Li 44 0 0 28 Jun 2023
Risk-Aware Algorithms for Combinatorial Semi-Bandits Ranga Shaarad Ayyagari Ambedkar Dukkipati 28 1 0 02 Dec 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization Chengshuai Shi Wei Xiong Cong Shen Jing Yang 65 24 0 27 Oct 2021
Confidence-Budget Matching for Sequential Budgeted Learning Yonathan Efroni Nadav Merlis Aadirupa Saha Shie Mannor 76 11 0 05 Feb 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions Xi Chen Yanjun Han Yining Wang 66 17 0 05 Jan 2021
Online Competitive Influence Maximization Jinhang Zuo Xutong Liu Carlee Joe-Wong John C. S. Lui Wei Chen 71 12 0 24 Jun 2020
Contextual Blocking Bandits Soumya Basu Orestis Papadigenopoulos Constantine Caramanis Sanjay Shakkottai 83 21 0 06 Mar 2020