The Complexity of Simple Stochastic Games
Jonas Dieckelmann
TL;DR
This paper surveys the computational complexity of simple stochastic games and reviews the most effective algorithms for solving these problems.
Contribution
It provides a comprehensive overview of the complexity classifications and algorithmic approaches for simple stochastic games.
Findings
Summary of known complexity results
Overview of best algorithms for each problem
Identification of open complexity questions
Abstract
In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Artificial Intelligence in Games · Game Theory and Applications