Neighborhood-Aware Graph Labeling Problem

Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran +1

Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G=(V,E)$, a label set of siz…