Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

DOI10.1002/nav.21738zbMath1411.91165OpenAlexW2612461156MaRDI QIDQ4632962

Noam Goldberg

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21738

zbMATH Keywords

convex optimizationNash equilibriumresource allocationnetwork interdictioncomputational game theoryellipsoid methodinspection gamenon-zero-sum game

Mathematics Subject Classification ID

Convex programming (90C25) Applications of game theory (91A80) Deterministic network models in operations research (90B10)

Related Items (7)

Incorporating monitoring technology and on-site inspections into an \(n\)-person inspection game ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Integer programming methods for solving binary interdiction games ⋮ On the complexity and approximation of the maximum expected value all-or-nothing subset ⋮ A two‐stage network interdiction‐monitoring game ⋮ Maximum probabilistic all-or-nothing paths ⋮ A survey of network interdiction models and algorithms

This page was built for publication: Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks