Probability Distributions on Partially Ordered Sets and Network Interdiction Games

DOI10.1287/MOOR.2021.1140MaRDI QIDQ5076709zbMATH OpenOpenAlexFDO

Authors Mathieu Dahan, Saurabh Amin, Patrick Jaillet

Publication date 17 May 2022

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.08516

zbMATH Keywords

duality theorynetwork interdiction gamesprobability distributions on posets

Mathematics Subject Classification ID

Flows in graphs (05C21) Large-scale problems in mathematical programming (90C06) Optimality conditions and duality in mathematical programming (90C46) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Equilibrium strategies for multiple interdictors on a common network
• Two-Person Zero-Sum Games for Network Interdiction
• Algorithms for network interdiction and fortification games
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Decomposition of probability marginals for security games in abstract networks

Cites work

• A game-theoretic framework for network security vulnerability assessment and mitigation
• A geometric view of parametric linear programming
• A new polynomial-time algorithm for linear programming
• Deterministic network interdiction
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Encyclopedia of Complexity and Systems Science
• 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
• scientific article; zbMATH DE number 3121284 (Why is no real title available?)
• Infrastructure security games
• Maximizing residual flow under an arc destruction
• Network flows. Theory, algorithms, and applications.
• On the power of randomization in network interdiction
• Optimal interdiction of a supply network
• Polynomial dual network simplex algorithms
• Removing Arcs from a Network
• Robust and adaptive network flows
• Stochastic network interdiction
• The complexity of computing a robust flow
• The minimum vulnerability problem
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach
• Two-Person Zero-Sum Games for Network Interdiction

Cited in

(4)

• Decomposition of probability marginals for security games in abstract networks
• Inspection game with imperfect detection technology
• Decomposition of probability marginals for security games in max-flow/min-cut systems
• Decomposing probability marginals beyond affine requirements

This page was built for publication: Probability Distributions on Partially Ordered Sets and Network Interdiction Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076709)