Stackelberg Shortest Path Tree Game, Revisited

Sergio Cabello

Let $G(V,E)$ be a directed graph with $n$ vertices and $m$ edges. The edges $E$ of $G$ are divided into two types: $E_F$ and $E_P$. Each edge of $E_F$ has a fixed price. The edges…