  In this article, we study a biobjective extension of the shortest path
network interdiction problem. Each arc in the network is associated with two
integer length values and two players compute their respective shortest paths
from source to sink independently from each other while an interdictor tries to
lengthen both shortest paths by removing arcs. We show that this problem is
intractable and that deciding whether a feasible interdiction strategy is
efficient, is NP- complete. We provide a solution procedure to solve the
problem on two-terminal series-parallel graphs in pseudopolynomial time.
