A Nonzero-Sum Network Interdiction Game

A novel nonzero-sum game is presented for a classical network interdiction problem. In this model an interdictor (e.g. an enforcement agent) decides how much of an inspection resource to spend along each arc in the network in order to capture the evader (e.g. a smuggler). The evader in turn selects a probability distribution on paths from source nodes to destinations. We show that under certain reasonable conditions defender strategies under a Nash equilibrium of this game can be determined in polynomial time.