We consider a game on graph $$G=\langle V, E\rangle $$ with two confronting classes of randomized players: $$\nu attackers, who choose vertices and seek to minimize the probability getting caught, single defender, chooses edges seeks maximize expected number attackers it catches. In Nash equilibrium, no player has an incentive unilaterally deviate from her strategy. The Price Defense is worst-c...