Contested route planning is cast as a zero-sum game and solved approximately by double oracle, with NP-hardness of exact play proved, but a flawed Red best-response reduction undermines the equilibrium claims.
Improving Homeland Security Decisions p
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Contested Route Planning
Contested route planning is cast as a zero-sum game and solved approximately by double oracle, with NP-hardness of exact play proved, but a flawed Red best-response reduction undermines the equilibrium claims.