Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Recursive Algorithm for Solving Simple Stochastic Games

Published 3 Oct 2021 in cs.DS and cs.GT | (2110.01030v1)

Abstract: We present two recursive strategy improvement algorithms for solving simple stochastic games. First we present an algorithm for solving SSGs of degree dd that uses at most O(⌊(d+1)2/2⌋n/2)O\left(\left\lfloor(d+1)^2/2\right\rfloor^{n/2}\right) iterations, with nn the number of MAX vertices. Then, we focus on binary SSG and propose an algorithm that has complexity O(φnPoly(N))O\left(\varphi^nPoly(N)\right) where φ=(1+5)/2\varphi = (1 + \sqrt{5})/2 is the golden ratio. To the best of our knowledge, this is the first deterministic strategy improvement algorithm that visits 2cn2^{cn} strategies with c<1c < 1.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.