Adapts the Extensive-Form Double Oracle algorithm to indefinite-horizon adversarial graph traversal games with two-sided incomplete information, proves finite termination to an epsilon-Nash equilibrium, and uses Value of Information to characterize deceptive equilibrium behaviors.
Multi-robot co- ordination in an adversarial graph-traversal game
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deception and Counter Deception in Adversarial Graph Traversal Game
Adapts the Extensive-Form Double Oracle algorithm to indefinite-horizon adversarial graph traversal games with two-sided incomplete information, proves finite termination to an epsilon-Nash equilibrium, and uses Value of Information to characterize deceptive equilibrium behaviors.