Zobrazeno 1 - 1
of 1
pro vyhledávání: '"de Montjoye, X. Badin"'
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 complexity bound, which implies and improves on the results of several arti
Externí odkaz:
http://arxiv.org/abs/2102.04922
