- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies finite-horizon zero-sum continuous-control games with one-sided private payoff information and hard state constraints. It proves value existence, shows that leaders in two information-relaxed games require at most control atoms, and argues that the resulting strategy pair becomes approximately unexploitable as decisions become more frequent. These results motivate a bounded atom-insertion solver. Validation uses analytical and constrained Hexner games, a synthetic history-encoding task, and a nonlinear car-chasing example, although the most realistic experiment is primarily qualitative and seems heavily simplified.
Critical strengths
One strength of the paper is that it provides a model for an important yet difficult combination of continuous control, asymmetric information, and hard state constraints. This is relevant to the literature and addresses the dynamic of private information and physical security in autonomous systems, which is crucial in applications like transportation and energy. The constraints are useful to reflect the limitations of feasible actions and imperfect information. This could lead to safer planning and equilibrium solving in certain multi-agent settings.
Critical weaknesses
-
Poor clarity and readability: The paper is extremely notation-dense, lacks a notation guide, introduces important definitions only briefly, and contains inconsistent writing and grammatical errors. This is critical to the reader's general understanding of the material.
-
Insufficient motivation: The game model and its modeling choices are not adequately justified through concrete research gaps or developed real-world examples. While the setting and model explored is well-motivated from a technical perspective, the introduction discusses motivation for four sentences before proceeding into model preliminaries, with a primary example from sports which feels underdeveloped, and then some vague gesturing at applications in defense, finance, cybersecurity.
-
Weak conceptual organization: The argument narrative is difficult to find/follow, particularly around the lower dual game, and does not clearly distinguish the exact theoretical results from the heuristic solver, or why some assumptions and modeling choices were changed when progressing from the existence of the atomic strategies to using neural solver.
-
Inadequate visual explanation: The figures are small and underdeveloped, while no schematic/diagram clearly explains the model/game, information flow, or relationship between the different formulations.
-
Limited empirical validation: The car-chasing experiment is heavily simplified and lacks convincing quantitative evidence of security, safety, or low exploitability. The results and analysis generally feel incomplete without dedicated space in the main text for unpacking the findings.
-
Central method is insufficiently demonstrated: The authors could not identify a setting in which P2 requires more than one atom, making it unclear when the proposed multi-atom insertion procedure is necessary or practically beneficial.
Questions for authors
-
Can the authors precisely explain which theoretical guarantees remain valid after introducing the neural model, local optimization, finite best-response archives, sampled constraints, and restricted strategy classes? Can the resulting approximation discrepancies/errors be quantified?
-
Can the authors provide a nontrivial experiment where P2 actually requires multiple atoms, together with exploitability and safety results demonstrating that atom insertion tangibly improves over the one-atom baseline?
-
Can the authors justify whether assumptions like repairability, viability-boundary, and Isaacs-type assumptions related to the vanishing exploitability actually hold in the car chasing setting? How are these conditions verified?
6 comments
Quantitative car evidence
“The car-chasing experiment is heavily simplified and lacks convincing quantitative evidence of security, safety, or low exploitability.”
The revised experiment reports evidence in three parts:
-
Security: We evaluate 54 P2 responses against the retained P1 strategy and 263 P1 response packages against the retained P2 strategy. Each package contains a P1 response for each of the three types. The gradient-based solves differentiate through safety corrections as well as the dynamics. One recorded full gradient of P1’s 102,036-parameter strategy against one P2 response took 770 seconds on eight CPU cores (GPU implementation showed little advantage for this particular task due to its long rollout). This measurement excludes prior constraint-matrix preparation and subsequent response audits; see recorded computation cost.
-
Safety: The solver applies a learned P1 continuation filter and a P2 stopping-safety filter for trajectory-correction routines. Separate audits checked 162 type histories from the P1 security solve for assigned-exit and P2 stopping continuations, and 789 type histories from the P2 security solve for stopping feasibility. The highlighted interaction is capture-free over its 3 s horizon. Appendix J.4 describes the safety filters, and the supplement reports the physical checks and numerical allowances.
-
Exploitability estimate: Using the same 54 P2 responses and 263 typewise P1 response packages, the empirical payoff gap decreases from 2.53 at initialization to 1.76 after training, a 30.7% reduction. The training comparison documents the model, checkpoints, and calculation. P1 is initialized from saved routes, and P2 from a previously trained base policy. Both use the current safety filters; neither is a completely random, unconstrained policy.
When does P2 need multiple atoms?
“Can the authors provide a nontrivial experiment where P2 actually requires multiple atoms, together with exploitability and safety results demonstrating that atom insertion tangibly improves over the one-atom baseline?”
The two-stage Bayesian benchmark has two types, observed first-stage actions, and history-dependent second-stage responses. Its exact value is , while the best deterministic P2 strategy guarantees only . Paired with an optimal P1 strategy, deterministic P2 has exploitability ; the recovered two-action P2 strategy has zero exploitability in exact arithmetic. Across 50 tie-breaking seeds, best-response-guided insertion recovers the optimum with five accepted local insertions and a maximum numerical residual below . This demonstrates both a need for P2 randomization and a measurable benefit from support insertion. The benchmark has no physical safety constraints. Its complete specification and reproduction code are available in the supplement, and a concise version can be incorporated into the paper.
Assumptions in the car setting
“Can the authors justify whether assumptions like repairability, viability-boundary, and Isaacs-type assumptions related to the vanishing exploitability actually hold in the car chasing setting? How are these conditions verified?”
The revised theorem avoids the earlier inward-pointing and boundary-persistence conditions. Its structural requirements include control-affine dynamics and convexity of P1's state-dependent control constraints. The bicycle equations satisfy the former, and the yaw constraint is convex in curvature at fixed speed. These facts can be checked directly from the equations.
In addition, the revised theorem requires (1) an initial state from which P1 can keep violations arbitrarily small against every admitted opponent throughout the horizon, and (2) control repairability at suitable positive tolerances. We tested numerical versions of these conditions in the car study.
For the first requirement, we select the initial state using players' safety filters (pre-trained based on their safety specifications), then check it through independent security-response searches.
For the second, we tested 3,840 candidate controls at 120 states, including 342 controls requiring a nonzero correction. All were successfully repaired under the numerical constraints and passed a doubled-resolution check. In the extended 1,024 state-perturbation tests, reducing the perturbation scale from to reduces the largest normalized correction from to . All 1,024 corrections passed the doubled-resolution check. Thus the tests support local repair as stated in the assumption.
Thank you for your response. Your explanations do clear up some things and the quality of the revised paper is higher.
On clarity, thanks for addressing clarity and organization. Although still quite dense, I find the paper easier to parse now. The added figures are useful. Would it be possible to include a consolidated notation table in the appendix?
On motivation, thanks for developing the car example further and making edits to the introduction to this extent. I still think the real-world demand for this work could be developed further, with specific references to how your model better captures some aspects of reality that existing approaches fail to consider.
A couple of lingering thoughts:
On theory vs. implementation, I understand that the numerical implementations/neural representations and optimizers don't exactly inherit the equilibrium guarantees from the theory. This is of course to be expected in practical implementation and empirical evaluation. To address this specifically, I would be interested in some bound on implementation error if possible. Or what additional assumptions might be required to do this.
On empirical evaluation, could you clarify how to interpret the reduction in estimated exploitability from 2.53 to 1.76 relative to the scale of payoffs, and what evidence there is that supports the strength of the best deviations the searches found. For example would additional search effort or different initializations change things? (separately, this reduction seems like an important result to include in the paper itself, section 6.3 perhaps).
On the P2 atoms setting, thanks for going through this. I do suggest you incorporate this benchmark into the paper.
On the car assumptions, appendix f.4 reports 37 cases flagged by a second opponent search whose admissibility validation is incomplete. Have these cases been investigated, and can they also be repaired? Could you clarify how these outstanding checks might qualify the evidence for local repairability and the reliability of the numerical safety checks?
Clarity, notation, and organization
We have edited the narrative and organized it into four steps: define the simultaneous game; introduce its two information relaxations; prove atomicity in those relaxations and bound exploitability using their values; then show that the bound vanishes under time-grid refinement with vanishing tolerances. The lower-game discussion explains P2's typewise payoff guarantees before introducing the dual value.
Motivation and modeling choices
We have made the car example explicit in the introduction. P1 privately knows which exit it intends to reach. P2 observes motion but not that intention. Steering and acceleration are continuous, while road, speed, turning, and separation constraints restrict feasible maneuvers. Concealing an exit intention can change P2's response, but the maneuver must preserve a feasible continuation. The example makes the interaction between information release and physical feasibility concrete.
Visual explanation
Figure 3 now highlights the interaction between the pursuer and evader's security strategies and includes the retained best responses found during training. Also see the animation of the same interaction.
Appendix D includes a visual comparison of the lower game G↓, the simultaneous game G, and the upper game G↑. It shows who observes the current action before responding and how the three values bound one another.
What survives numerical approximation?
Value existence, atomicity, and the vanishing result are mathematical properties of the stated games and remain valid independently of the numerical implementation. They justify the ideal atomic strategy class and motivate the training of policy networks with at most I control outputs along a game tree with at most IK terminal branches per type against a pure response. The dual construction also supplies a recursive private-memory representation for P2, which motivates the solver's memory coordinate. The theory does not establish that a particular network and local optimizer recover the theoretical strategies.
For a feasible strategy pair in a fixed game, exploitability equals the difference between its two exact opposing-response values:
=\sup_{\zeta'}J(\eta,\zeta')-\inf_{\eta'}J(\eta',\zeta).$$ The car study estimates these extrema using recorded responses. Its empirical exploitability decreases from 2.53 to 1.76. Note that the initial exploitability is measured on warm-started policies rather than random initialization, since the latter can easily violate state constraints.