Decomposition of probability marginals for security games in abstract networks

DOI10.1007/978-3-031-32726-1_22zbMath1528.91020arXiv2211.04922OpenAlexW4377200044MaRDI QIDQ6086010

Jannik Matuschke

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Security games on matroids
• On the power of randomization in network interdiction
• Abstract network flow with intermediate storage for evacuation planning
• Abstract flows over time: a first step towards solving dynamic packing problems
• The complexity of computing a robust flow
• Integrated Line Planning and Passenger Routing: Connectivity and Transfers
• Security and Game Theory
• Maximal Flow Through a Network
• A Polynomial Algorithm for Weighted Abstract Flow
• A generalization of max flow—min cut
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games
• Fare Evasion in Transit Networks

This page was built for publication: Decomposition of probability marginals for security games in abstract networks