“Identifying shortest paths between nodes in a network is an important task in applications involving routing of resources. Recent work has shown that a malicious actor can manipulate a graph to make traffic between two nodes of interest follow their target path. In this paper, we develop a defense against such attacks by modifying the weights of the graph that users observe. … In this context, we also consider a zero-sum version of the game, in which the defender’s goal is to minimize cost while achieving the minimum possible attack probability.”

Find the paper and full list of authors at ArXiv.