Adaptivity in network interdiction

DOI10.1007/978-3-319-68711-7_3zbMATH Open1453.91029OpenAlexW2760854312MaRDI QIDQ1675445FDOQ1675445

Authors: Bastián Bahamondes, José R. Correa, Jannik Matuschke, Gianpaolo Oriolo 

Publication date: 27 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-68711-7_3

Recommendations

• An interdiction game on a queueing network with multiple intruders
• Dynamic shortest-path interdiction
• Evader interdiction: algorithms, complexity and collateral damage
• Optimal Interdiction of Unreactive Markovian Evaders
• Network interdiction with asymmetric cost uncertainty

zbMATH Keywords

computing complexityinterdiction of fare evasion or smugglingnetwork security game

Mathematics Subject Classification ID

Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Cited In (4)

• The weighted intruder path covering problem
• An interdiction game on a queueing network with multiple intruders
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks

This page was built for publication: Adaptivity in network interdiction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675445)