The following pages link to (Q4287357):
Displaying 50 items.
- Expected reachability-time games (Q278757) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Chess-like games may have no uniform Nash equilibria even in mixed strategies (Q457857) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
- Another sub-exponential algorithm for the simple stochastic game (Q652540) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Comparison of algorithms for simple stochastic games (Q2105472) (← links)
- Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
- Infinite-duration poorman-bidding games (Q2190378) (← links)
- Fixpoint theory -- upside down (Q2233395) (← links)
- Automatic verification of competitive stochastic systems (Q2248068) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- A non-iterative algorithm for generalized pig games (Q2319668) (← links)
- The role of quantum correlations in cop and robber game (Q2329935) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Value iteration for simple stochastic games: stopping criterion and learning algorithm (Q2672267) (← links)
- On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443) (← links)
- Value Iteration (Q3512436) (← links)
- (Q4553289) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
- (Q5021007) (← links)
- (Q5053310) (← links)
- (Q5079761) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- (Q5090455) (← links)
- Infinite-Duration Bidding Games (Q5111634) (← links)
- (Q5111641) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- (Q5232902) (← links)
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve (Q5458347) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- (Q5856412) (← links)
