Publication:4287357
From MaRDI portal
zbMath0808.90141MaRDI QIDQ4287357
Publication date: 15 March 1995
68Q25: Analysis of algorithms and problem complexity
90C90: Applications of mathematical programming
90C60: Abstract computational complexity for mathematical programming problems
90C20: Quadratic programming
68Q45: Formal languages and automata
91A15: Stochastic games, stochastic differential games
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Unnamed Item, Constant Rank Two-Player Games are PPAD-hard, On Solving Mean Payoff Games Using Pivoting Algorithms, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Parity Games and Propositional Proofs, Optimally Resilient Strategies in Pushdown Safety Games, Infinite-Duration Bidding Games, Simple Stochastic Games with Few Random Vertices Are Easy to Solve, Stochastic Müller Games are PSPACE-Complete, Unnamed Item, Unnamed Item, Optimistic and topological value iteration for simple stochastic games, Expected reachability-time games, Quantitative verification and strategy synthesis for stochastic games, Strategy improvement for concurrent reachability and turn-based stochastic safety games, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Chess-like games may have no uniform Nash equilibria even in mixed strategies, Equilibria, fixed points, and complexity classes, A game-based abstraction-refinement framework for Markov decision processes, On strategy improvement algorithms for simple stochastic games, Another sub-exponential algorithm for the simple stochastic game, Combinatorial structure and randomized subexponential algorithms for infinite games, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Unique sink orientations of grids, A short certificate of the number of universal optimal strategies for stopping simple stochastic games, Approximation schemes for stochastic mean payoff games with perfect information and few random positions, Comparison of algorithms for simple stochastic games, Verification of multiplayer stochastic games via abstract dependency graphs, Infinite-duration poorman-bidding games, Fixpoint theory -- upside down, Automatic verification of competitive stochastic systems, The complexity of solving reachability games using value and strategy iteration, A non-iterative algorithm for generalized pig games, The role of quantum correlations in cop and robber game, A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions, A note on the approximation of mean-payoff games, Concurrent reachability games, Value iteration for simple stochastic games: stopping criterion and learning algorithm, On Pure Nash Equilibria in Stochastic Games, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Automatizability and Simple Stochastic Games, Graph Games and Reactive Synthesis, Symmetric Strategy Improvement, Solving Simple Stochastic Games, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, Value Iteration
