Decentralized Online Bandit Optimization on Directed Graphs with Regret Bounds

Johan Östman, Ather Gattami, Daniel Gillblad

We consider a decentralized multiplayer game, played over $T$ rounds, with a leader-follower hierarchy described by a directed acyclic graph. For each round, the graph structure di…