Pages that link to "Item:Q3652196"
From MaRDI portal
The following pages link to The Complexity of Solving Stochastic Games on Graphs (Q3652196):
Displayed 26 items.
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Strategy recovery for stochastic mean payoff games (Q528499) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Tropical spectrahedra (Q1985292) (← links)
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
- The operator approach to entropy games (Q2321934) (← links)
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information (Q2408625) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- Value iteration for simple stochastic games: stopping criterion and learning algorithm (Q2672267) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- The Complexity of Synthesis from Probabilistic Components (Q3449469) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
- (Q5090455) (← links)
- Stochastic Games (Q5149735) (← links)
- Optimistic and topological value iteration for simple stochastic games (Q6160920) (← links)