Shreyas S

Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits

We study the classical linear bandit problem on \emph{graphs} modelling arm rewards through an underlying graph structure $G$($N$,$E$) such that rewards of neighboring nodes are similar. Previous attempts along this line have primarily considered the arm rewards to be a smooth function over graph La…