Playing with and against Hedge in interdiction games

Two players, an “evader” and an “interdictor,’ are repeatedly involved in a network interdiction game, which is mainly played over the arcs of a cut between two nodes. The evader tries to transfer a load from an origin to a destination. The interdictor tries to inhibit the transfer and/or capture the load. The evader uses, as an online learning tool, the Hedge (or multiplicative updates) algorithm. This work focuses on the countermeasures that can be taken by the interdictor by taking into account recent results in the area. We show that a greedy behavior is near optimal for the interdictor.