Year: 2021
Type: preprint
Abstract: We present two recursive strategy improvement algorithms for solving simple stochastic games. First we present an algorithm for solving SSGs of degree $d$ that uses at most $O\left(\left\lfloor(d+1)^2/2\right\rfloor^{n/2}\right)$ iterations, with $n$ the number of MAX vertices. Then, we focus on binary SSG and propose an algorithm that has complexity $O\left(φ^nPoly(N)\right)$ where $φ= (1 + \sqrt{5})/2$ is the golden ratio. To the best of our knowledge, this is the first deterministic strategy improvement algorithm that visits $2^{cn}$ strategies with $c < 1$.
Source: arXiv (Cornell University)
Author: de Montjoye, Xavier Badin
Institution: Université de Versailles Saint-Quentin-en-Yvelines
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3203434534