Stackelberg network interdiction game: nodal model and algorithm

Abstract

Network interdiction game is a class of Stackelberg games on networks. In this paper, we consider a extended shortest path network interdiction game in which the interdiction focuses on nodes. In this problem, the evader attempts to traverse the shortest path from the origin to destination, while the interdictor attempts to maximize the shortest path length by interdicting some nodes of the network with limited resources. we define the nodal shortest path network interdiction problem as a bilevel program and formulate it as a mixed integer program. A novel interdiction subgraph decomposition algorithm is proposed to solve this program. We use both simulated grid network and real transportation network data in the computational experiments, and the results show that the efficiency of proposed algorithm is improved a lot comparing with the existing algorithm. And the proposed algorithm can be used to solve general shortest path network interdiction problem with large scale.