A forward algorithm for a class of Markov zero-sum stopping games
Journal of Applied Probability · 2026-09 · 63 (3) · 1302-1329
DOI: 10.1017/jpr.2026.10082 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Probability, online erschienen am 31.03.2026. Verfasst von Nhat-Thang Le. Die Arbeit nennt 13 Literaturangaben.
Abstract (Originalsprache)
In this paper we propose a new efficient algorithm to compute the value function for zero-sum stopping games featuring two players with opposing interests. This can be seen as a game version of the ‘forward algorithm’ for (one-player) optimal stopping problems, first introduced by Irle (2006) for discrete-time Markov chains and later revisited by Miclo and Villeneuve (2021) for continuous-time Markov processes on general state spaces. This paper focuses on a game driven by a homogeneous continuous-time Markov chain taking values in a finite state space and also discusses the number of iterations needed. Illustrated computational implementations for a few particular examples are also provided.
Zitieren
APA
Le, N. (2026). A forward algorithm for a class of Markov zero-sum stopping games. Journal of Applied Probability, 63(3), 1302-1329. https://doi.org/10.1017/jpr.2026.10082
Vancouver
Le N. A forward algorithm for a class of Markov zero-sum stopping games. Journal of Applied Probability. 2026;63(3):1302-1329. doi:10.1017/jpr.2026.10082
BibTeX
@article{Le2026,
author = {Le, Nhat-Thang},
title = {A forward algorithm for a class of Markov zero-sum stopping games},
journal = {Journal of Applied Probability},
year = {2026},
volume = {63},
number = {3},
pages = {1302--1329},
doi = {10.1017/jpr.2026.10082}
}
EUVIMED