A short certificate of the number of universal optimal strategies for stopping simple stochastic games
From MaRDI portal
Publication:1350746
DOI10.1016/0020-0190(95)00181-6zbMath1047.91505OpenAlexW2061604345MaRDI QIDQ1350746
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00181-6
Related Items (1)
Cites Work
- Unnamed Item
- Games against nature
- Ordered field property for stochastic games when the player who controls transitions changes from state to state
- Computing a perfect strategy for nxn chess requires time exponential in n
- Positional strategies for mean payoff games
- The complexity of short two-person games
- The complexity of stochastic games
- Complete problems for deterministic polynomial time
- Discounted Markov games: Generalized policy iteration method
- Discounted Markov games; successive approximation and stopping times
- On the complexity of some two-person perfect-information games
- A note on the graph isomorphism counting problem
- A subexponential randomized algorithm for the simple stochastic game problem
- Algorithms for discounted stochastic games
- N by N Checkers is Exptime Complete
- Nonlinear programming and stationary strategies in stochastic games
- The Complexity of Enumeration and Reliability Problems
- GO Is Polynomial-Space Hard
- Successive Approximation Methods in Undiscounted Stochastic Games
- A Monte-Carlo Algorithm for Estimating the Permanent
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Every Prime Has a Succinct Certificate
- A Combinatorial Problem Which Is Complete in Polynomial Space
- On Nonterminating Stochastic Games
- Algorithms for Stochastic Games with Geometrical Interpretation
- Stochastic Games
This page was built for publication: A short certificate of the number of universal optimal strategies for stopping simple stochastic games
