Probability Distributions on Partially Ordered Sets and Network Interdiction Games

DOI10.1287/MOOR.2021.1140OpenAlexW3037117416MaRDI QIDQ5076709FDOQ5076709

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

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• A new polynomial-time algorithm for linear programming
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Finding the most vital arcs in a network
• Deterministic network interdiction
• Removing Arcs from a Network
• Stochastic network interdiction
• Finding the n Most Vital Links in Flow Networks
• Infrastructure security games
• Two-Person Zero-Sum Games for Network Interdiction
• Title not available (Why is that?)
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Encyclopedia of Complexity and Systems Science
• Maximizing residual flow under an arc destruction
• Optimal interdiction of a supply network
• The minimum vulnerability problem
• A geometric view of parametric linear programming
• Polynomial dual network simplex algorithms
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach
• On the power of randomization in network interdiction
• A game-theoretic framework for network security vulnerability assessment and mitigation
• Robust and adaptive network flows
• The complexity of computing a robust flow

Cited In (1)

• Decomposition of probability marginals for security games in abstract networks

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)