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, Network routing for insurgency: An adversarial risk analysis framework, Optimal ambushing search for a moving target, 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, Designing robust coverage networks to hedge against worst-case facility losses, The multi-terminal maximum-flow network-interdiction problem, On short paths interdiction problems: Total and node-wise limited interdiction, 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, 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
