Pages that link to "Item:Q4849325"
From MaRDI portal
The following pages link to Two-Person Zero-Sum Games for Network Interdiction (Q4849325):
Displayed 50 items.
- Infrastructure security games (Q297288) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- Determining all Nash equilibria in a (bi-linear) inspection game (Q421679) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Path cooperative games (Q724748) (← links)
- Upper and lower values in zero-sum stochastic games with asymmetric information (Q823849) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- An interdiction game on a queueing network with multiple intruders (Q1753530) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
- On sabotage games (Q1785757) (← links)
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Stackelberg production-protection games: defending crop production against intentional attacks (Q2242197) (← links)
- A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
- Securing infrastructure facilities: when does proactive defense help? (Q2292114) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- Hitting a path: a generalization of weighted connectivity via game theory (Q2424795) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
- A sequential Stackelberg game for dynamic inspection problems (Q2672097) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- Shortest path network interdiction with asymmetric information (Q3184598) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- Deception tactics for network interdiction: A multiobjective approach (Q4648690) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- Network Inspection for Detecting Strategic Attacks (Q5080657) (← links)
- Toward Robust Monitoring of Malicious Outbreaks (Q5086023) (← links)
- Mitigating Interdiction Risk with Fortification (Q5131462) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Network routing for insurgency: An adversarial risk analysis framework (Q5300454) (← links)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
- Optimal ambushing search for a moving target (Q5943562) (← links)