A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem
Reads0
Chats0
TLDR
This work describes a randomized algorithm for the simple stochastic game problem that requires 2O(?n) expected operations for games with n vertices and is the first subexponential time algorithm for this problem.Abstract:
We describe a randomized algorithm for the simple stochastic game problem that requires 2O(?n) expected operations for games with n vertices. This is the first subexponential time algorithm for this problem.read more
Citations
More filters
Journal ArticleDOI
The complexity of mean payoff games on graphs
Uri Zwick,Mike Paterson +1 more
TL;DR: In this paper, the authors studied the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan.
Algorithms for Sequential Decision Making
TL;DR: This thesis shows how to answer the question ``What should I do now?
Journal ArticleDOI
On the undecidability of probabilistic planning and related stochastic optimization problems
TL;DR: A complexity analysis of planning under uncertainty is presented, showing the "probabilistic classical planning" problem to be formally undecidable and any problem statement where the agent operates over an infinite or indefinite time horizon, and has available only probabilistic information about the system's state.
Book ChapterDOI
Modal and temporal logics for processes
TL;DR: First it is shown that property checking can be understood in terms of game playing, and then sound and complete tableau proof systems for proving temporal properties of processes are presented.
Journal ArticleDOI
A Deterministic Subexponential Algorithm for Solving Parity Games
TL;DR: This work uses a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games, and is almost as fast as the randomized algorithms mentioned above.
References
More filters
Journal ArticleDOI
Stochastic Games
TL;DR: In a stochastic game the play proceeds by steps from position to position, according to transition probabilities controlled jointly by the two players, and the expected total gain or loss is bounded by M, which depends on N 2 + N matrices.