An iterative security game for computing robust and adaptive network flows
From MaRDI portal
Publication:2669664
Recommendations
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A bilevel mixed-integer program for critical infrastructure protection planning
- A game-theoretic framework for network security vulnerability assessment and mitigation
- A polynomial time primal network simplex algorithm for minimum cost flows
- Adjustable robust solutions of uncertain linear programs
- Affine recourse for the robust network design problem: between static and dynamic routing
- An exact solution approach for the interdiction median problem with fortification
- Data-driven robust optimization
- Deterministic network interdiction
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Finding the n Most Vital Links in Flow Networks
- Finding the most vital arcs in a network
- Game theory meets network security and privacy
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- Infrastructure security games
- Network design and defence
- Network flows. Theory, algorithms, and applications.
- On the power of randomization in network interdiction
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Removing Arcs from a Network
- Robust and adaptive network flows
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust Solutions to Uncertain Semidefinite Programs
- Sampling Based Approaches for Minimizing Regret in Uncertain Markov Decision Processes (MDPs)
- Stochastic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The minimum vulnerability problem
- The Price of Robustness
- The robust network loading problem with dynamic routing
- Theory and applications of robust optimization
- Towards a metric for communication network vulnerability to attacks: a game theoretic approach
- Two-Person Zero-Sum Games for Network Interdiction
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(7)- Bilevel model for adaptive network flow problem
- Rolling horizon games of resilient networks with non-uniform horizons
- $$\mathsf {QFlip}$$ : An Adaptive Reinforcement Learning Strategy for the $$\mathsf {FlipIt}$$ Security Game
- Strategic monitor placement against malicious flows
- Flow games
- Robust and adaptive network flows
- A robust optimization approach for a two-player force-design game
This page was built for publication: An iterative security game for computing robust and adaptive network flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669664)
