Decomposition of probability marginals for security games in max-flow/min-cut systems

J Matuschke - Mathematical Programming, 2024 - Springer
Given a set system (E, P) with ρ∈[0, 1] E and π∈[0, 1] P, our goal is to find a probability
distribution for a random set S⊆ E such that Pr e∈ S= ρ e for all e∈ E and Pr P∩ S≠∅≥ π …

Decomposing probability marginals beyond affine requirements

J Matuschke - International Conference on Integer Programming and …, 2024 - Springer
Consider the triplet (E, P, π), where E is a finite ground set, P⊆ 2 E is a collection of subsets
of E and π: P→[0, 1] is a requirement function. Given a vector of marginals ρ∈[0, 1] E, our …