On sabotage games

Sabotage games on a graph involve Runner who wants to travel between two given vertices and Blocker who aims to prevent Runner from arriving at his destination by destroying edges. This paper completely characterizes games with multiple destinations on weighted trees for both local and global cutting rules of arbitrary capacity. The games on weighted graphs are characterized using the tree unraveling of the graph.