Two-Person Zero-Sum Games for Network Interdiction
From MaRDI portal
Publication:4849325
DOI10.1287/opre.43.2.243zbMath0832.90124MaRDI QIDQ4849325
Publication date: 5 March 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/343d6285f405e843b0fb452e1acae6b577e0f878
probability of detection; network flow techniques of polynomial complexity; probabilistic path-selection strategy
90C90: Applications of mathematical programming
91A05: 2-person games
91A43: Games involving graphs
90B10: Deterministic network models in operations research
91A24: Positional games (pursuit and evasion, etc.)
Related Items
Deception tactics for network interdiction: A multiobjective approach, Sequential Shortest Path Interdiction with Incomplete Information, The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, Probability Distributions on Partially Ordered Sets and Network Interdiction Games, Network Inspection for Detecting Strategic Attacks, Toward Robust Monitoring of Malicious Outbreaks, Mitigating Interdiction Risk with Fortification, Interdiction Games and Monotonicity, with Application to Knapsack Problems, Maximum Capacity Path Interdiction Problem with Fixed Costs, Network routing for insurgency: An adversarial risk analysis framework, Optimal ambushing search for a moving target, Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire, A survey on mixed-integer programming techniques in bilevel optimization, Infrastructure security games, Optimal search and ambush for a hider who can escape the search region, The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm, Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning, Determining all Nash equilibria in a (bi-linear) inspection game, Analysis of budget for interdiction on multicommodity network flows, Path-disruption games: bribery and a probabilistic model, Designing robust coverage networks to hedge against worst-case facility losses, The multi-terminal maximum-flow network-interdiction problem, Path cooperative games, Upper and lower values in zero-sum stochastic games with asymmetric information, On short paths interdiction problems: Total and node-wise limited interdiction, Stochastic maximum flow interdiction problems under heterogeneous risk preferences, Protection of flows under targeted attacks, The maximum clique interdiction problem, An interdiction game on a queueing network with multiple intruders, A dynamic reformulation heuristic for generalized interdiction problems, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder, Network interdiction to minimize the maximum probability of evasion with synergy between applied resources, On sabotage games, Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs, Equilibrium strategies for multiple interdictors on a common network, The continuous maximum capacity path interdiction problem, Stackelberg production-protection games: defending crop production against intentional attacks, A bi-level model and memetic algorithm for arc interdiction location-routing problem, Securing infrastructure facilities: when does proactive defense help?, A survey of network interdiction models and algorithms, A decomposition approach for stochastic shortest-path network interdiction with goal threshold, Designing networks with resiliency to edge failures using two-stage robust optimization, Hitting a path: a generalization of weighted connectivity via game theory, An iterative security game for computing robust and adaptive network flows, A sequential Stackelberg game for dynamic inspection problems, Risk-Averse Shortest Path Interdiction, Reformulation and sampling to solve a stochastic network interdiction problem, Shortest path network interdiction with asymmetric information, The Least-Core and Nucleolus of Path Cooperative Games, A Brief Overview of Interdiction and Robust Optimization
