Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
arXiv:2503.07555v3 Announce Type: replace
Abstract: We study multi-armed bandits under network interference, where each unit’s reward depends on its own treatment and those of its neighbors in a given graph. This induces an exponentially large action …