A general algorithm solves two-agent security games modeled as bi-agent influence diagrams by turning expected-utility maximization into mode-finding via augmented probability simulation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computational adversarial risk analysis for general security games
A general algorithm solves two-agent security games modeled as bi-agent influence diagrams by turning expected-utility maximization into mode-finding via augmented probability simulation.