scientific article; zbMATH DE number 549853

Publication date: 15 March 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

successive approximation simple stochastic game Hoffman-Karp improvement algorithm

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (56)

Expected reachability-time games ⋮ Symmetric Strategy Improvement ⋮ Graph Games and Reactive Synthesis ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ Strategy improvement for concurrent reachability and turn-based stochastic safety games ⋮ A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games ⋮ A game-based abstraction-refinement framework for Markov decision processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ On Pure Nash Equilibria in Stochastic Games ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ Infinite-duration poorman-bidding games ⋮ Parity Games and Propositional Proofs ⋮ Convex lattice equation systems ⋮ Solving Simple Stochastic Games ⋮ A Simple P-Matrix Linear Complementarity Problem for Discounted Games ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Fixpoint Theory -- Upside Down ⋮ The complexity of stochastic Müller games ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Value Iteration ⋮ On the complexity of computational problems associated with simple stochastic games ⋮ Independent learning in stochastic games ⋮ On strategy improvement algorithms for simple stochastic games ⋮ Unnamed Item ⋮ Chess-like games may have no uniform Nash equilibria even in mixed strategies ⋮ Equilibria, fixed points, and complexity classes ⋮ A note on the approximation of mean-payoff games ⋮ Another sub-exponential algorithm for the simple stochastic game ⋮ Unique sink orientations of grids ⋮ Fixpoint theory -- upside down ⋮ Concurrent reachability games ⋮ Automatizability and Simple Stochastic Games ⋮ Unnamed Item ⋮ Automatic verification of competitive stochastic systems ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ The complexity of solving reachability games using value and strategy iteration ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Simple Stochastic Games with Few Random Vertices Are Easy to Solve ⋮ Stochastic Müller Games are PSPACE-Complete ⋮ Unnamed Item ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ A non-iterative algorithm for generalized pig games ⋮ Infinite-Duration Bidding Games ⋮ The role of quantum correlations in cop and robber game ⋮ Comparison of algorithms for simple stochastic games ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games ⋮ Verification of multiplayer stochastic games via abstract dependency graphs

This page was built for publication: