Near-Optimal Mixed Strategy for Zero-Sum Differential Games
Tao Xu, Wang Xi, and Jianping He

TL;DR
This paper introduces a novel framework for synthesizing near-optimal mixed strategies in zero-sum differential games by mapping them to surrogate stochastic differential games and discretizing control spaces.
Contribution
It proposes a weak approximation framework and a control-space discretization algorithm that efficiently produces executable strategies with provable error bounds.
Findings
The method achieves near-optimal strategies with an error of order $ar heta$.
The discretization algorithm simplifies infinite-dimensional problems into linear programs.
Numerical examples validate the theoretical approximation bounds.
Abstract
Synthesizing near-optimal mixed strategies for zero-sum differential games (ZSDGs) has been a longstanding challenge. Existing research mainly focuses on characterizing the theoretical value function, while the practical design of executable mixed strategies remains open. To address this issue, we propose a novel weak approximation framework. The core idea is to map the original mixed-strategy game into a surrogate stochastic differential game (SDG) under pure strategies. This mapping ensures that both state distributions and cost expectations closely match the original game. Based on the solution of this auxiliary SDG, the original game value can be approximated, and near-optimal mixed strategies can be synthesized. To operationalize this framework, we develop a constructive control-space discretization algorithm for general ZSDGs. By parameterizing the infinite-dimensional measure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
