Revealing graph bandits for maximizing local influence

We study a graph bandit setting where the objective of the learner is to detect the most influential node of a graph by requesting as little information from the graph as possible. One of the relevant applications for this setting is marketing in social networks, where the marketer aims at finding and taking advantage of the most influential customers. The existing approaches for bandit problems on graphs require either partial or complete knowledge of the graph. In this paper, we do not assume any knowledge of the graph, but we consider a setting where it can be gradually discovered in a sequential and active way. At each round, the learner chooses a node of the graph and the only information it receives is a…

• DF
  Deutsche Forschungsgemeinschaft
• AN
  Agence Nationale de la Recherche

  Award: ANR-14-CE24-0010
• MD
  Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche