- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes , an -optimal sequential approach for solving finite-horizon two-player zero-sum partially observable stochastic games (zs-POSGs). The authors reformulate the simultaneous backup of the existing work into two planning sub-stages while preserving the original game value and information structure. By exploiting the max-of-concave structure of the value function, the proposed method separates the simultaneous Bellman backup into two linear programs and reduces the computational cost of the optimization. Experiments on several benchmark games demonstrate improved computational efficiency and lower policy exploitability compared with existing methods, particularly for larger horizons.
Critical strengths
- The presentation of this paper is complete and clear. The structure of this manuscript is well-organized. The topic of this work is interesting and useful.
- The authors provide a set of solid mathematical proofs.
- The experiments efficiently support the proposed method.
Critical weaknesses
- I think that a part is missing between steps 1 and 2 in Appendix C.2. Because the derivation process involves a large leap (the transition is too fast), it is difficult for readers to understand the author's line of thought. It is recommended to provide a complete derivation process so that readers can understand the equations in .
- The proof of Theorem 4.5 is based on without pruning. However, Algorithms 3 and 4 employ a pruning strategy. The authors should provide an ablation study to demonstrate the effect of pruning on . Otherwise, Theorem 4.5 will not support the relevant claims in the paper.
Questions for authors
Please review my weaknesses.
2 comments
I thank the authors for their effort to address my concerns and questions. I will maintain my previous positive score for this paper.
We thank the reviewer for their time. In response, we have revised the manuscript to include additional explanations and new plots. A summary of the changes is provided below.
The missing derivation between Steps 1 and 2 of Appendix C.2.
Appendix C.2 now starts from the Bellman objective and substitutes the envelope representation of the continuation value. Step 1 expands the successor weighted beliefs, moves the transition kernel onto the continuation vectors, and combines the reward and future value to obtain the backup coefficients. Step 2 justifies the minimax exchange and separates the minimisation by private history. Step 3 derives LP0 and proves its equivalence to LP2 in both directions by eliminating the branch variables. The argument includes zero mixture weights and does not assume that every auxiliary inequality is tight at every optimum.
Theorem 4.5 concerns the unpruned algorithm, whereas the experiments use pruning.
We make this scope explicit after Theorem 4.5. Table 3 compares both algorithms with and without all pruning mechanisms. For Seq at horizon~5, pruning reduces runtime from 54 to 30 s on Adversarial Tiger, 467 to 44 s on MABC, and 101 to 72 s on Recycling. Appendix J.2 discusses the full results. This ablation quantifies pruning's empirical effect; the theoretical guarantee remains restricted to the unpruned algorithm.