Two-Person Zero-Sum Games for Network Interdiction
From MaRDI portal
Publication:4849325
DOI10.1287/opre.43.2.243zbMath0832.90124OpenAlexW2000050888MaRDI 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 detectionnetwork flow techniques of polynomial complexityprobabilistic path-selection strategy
Applications of mathematical programming (90C90) 2-person games (91A05) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (55)
Upper and lower values in zero-sum stochastic games with asymmetric information ⋮ Infrastructure security games ⋮ Network routing for insurgency: An adversarial risk analysis framework ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ Reformulation and sampling to solve a stochastic network interdiction problem ⋮ Shortest path network interdiction with asymmetric information ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Network Inspection for Detecting Strategic Attacks ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Toward Robust Monitoring of Malicious Outbreaks ⋮ An iterative security game for computing robust and adaptive network flows ⋮ A sequential Stackelberg game for dynamic inspection problems ⋮ Designing robust coverage networks to hedge against worst-case facility losses ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Hitting a path: a generalization of weighted connectivity via game theory ⋮ Risk‐averse optimization and resilient network flows ⋮ Determining all Nash equilibria in a (bi-linear) inspection game ⋮ A two‐stage network interdiction‐monitoring game ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Attack and interception in networks ⋮ Mitigating Interdiction Risk with Fortification ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Interdiction Games and Monotonicity, with Application to Knapsack Problems ⋮ Protection of flows under targeted attacks ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ The maximum clique 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 ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Path-disruption games: bribery and a probabilistic model ⋮ 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 ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ 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 ⋮ Optimal ambushing search for a moving target ⋮ The multi-terminal maximum-flow network-interdiction problem ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ On sabotage games ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ Path cooperative games ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ 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 ⋮ Risk-Averse Shortest Path Interdiction ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
This page was built for publication: Two-Person Zero-Sum Games for Network Interdiction
