2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2021★ 2 cited
A Recursive Algorithm for Solving Simple Stochastic Games
Xavier Badin de Montjoye
We present two recursive strategy improvement algorithms for solving simple stochastic games. First we present an algorithm for solving SSGs of degree that uses at most $O\left…
cs.GT2021
A Generic Strategy Improvement Method for Simple Stochastic Games
D. Auger, X. Badin de Montjoye, Y. Strozecki
We present a generic strategy iteration algorithm (GSIA) to find an optimal strategy of a simple stochastic game (SSG). We prove the correctness of GSIA, and derive a general compl…