Paperlane

no. 16 · Tuesday 17 November 2026

Approximation and Error Bounds for Zero-Sum Stopping Games with Probability Criteria

Xin Wen, Xianping Guo, Xin Guo and Zewu Zheng

math.OC · 23 pp

Abstract

This paper studies a two-person zero-sum stochastic game, which must terminate when either player quits the game or a state of the game first enters a prescribed target set. The performance criterion is the probability that the total reward reaches a given threshold. First, under a mild condition, we prove the existence of the value and a Nash equilibrium of the game by developing a comparison theorem. Second, for solving the game with infinite states, we develop a finite-state approximation method based on truncation, and derive explicit error bounds between the values of the truncated and original games. Third, using the error bounds, we design an effective algorithm, by which we can not only obtain any approximation of the value and Nash equilibria of the original game, but also provide convergence analysis of the approximation. Finally, a queueing example is used to illustrate the advantage of our condition and the effectiveness of our algorithm.

comments
23 pages, 2 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.20428 ↗