A new algorithm, CAMS, reformulates the Bellman backup in one-sided-information differential games into small nonconvex minimax problems, achieving complexity independent of the continuous action space size and demonstrating this on a homing game.
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
-
Two-Player Zero-Sum Differential Games with One-Sided Information
A new algorithm, CAMS, reformulates the Bellman backup in one-sided-information differential games into small nonconvex minimax problems, achieving complexity independent of the continuous action space size and demonstrating this on a homing game.