Widest paths and global propagation in bounded value iteration for stochastic games

DOI10.1007/978-3-030-53291-8_19zbMath1478.68171arXiv2007.07421OpenAlexW3101560443MaRDI QIDQ2226749

Thomas Haas, Kittiphon Phalakarn, Ichiro Hasuo, Toru Takisaka

Publication date: 9 February 2021

Full work available at URL: https://arxiv.org/abs/2007.07421

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Comparison of algorithms for simple stochastic games

This page was built for publication: Widest paths and global propagation in bounded value iteration for stochastic games