Weakly Observable Graph Bandit

A generalization of the multi-armed bandit in which actions correspond to nodes of a directed graph and the agent can observe only the losses of out-neighbors of the selected action; the agent cannot directly know which nodes are unobservable, and feedback visibility depends on the graph structure.