Attack and interception in networks
From MaRDI portal
Publication:6180414
Recommendations
Cites work
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- A game of hide and seek in networks
- A problem in network interdiction
- A Social Equilibrium Existence Theorem*
- A survey of network interdiction models and algorithms
- Attack, Defence, and Contagion in Networks
- Deterministic network interdiction
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- How do you defend a network?
- Individual security, contagion, and network design
- Maximizing the minimum source-sink path subject to a budget constraint
- Network design and defence
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Removing Arcs from a Network
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(5)- A generalized approach to solve perfect Bayesian Nash equilibrium for practical network attack and defense
- On poisoned Wardrop equilibrium in congestion games
- Min–max optimization of node‐targeted attacks in service networks
- A two-network adversarial game: model, strategy, and structure
- Optimally reconnecting graphs against an edge-destroying adversary
This page was built for publication: Attack and interception in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180414)