Pages that link to "Item:Q1187025"

The following pages link to The complexity of stochastic games (Q1187025):

Displaying 50 items.

• Planning and acting in partially observable stochastic domains (Q72343) (← links)
• Expected reachability-time games (Q278757) (← links)
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
• Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
• Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
• On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
• Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114) (← links)
• Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results (Q400030) (← links)
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
• A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
• The complexity of stochastic Müller games (Q418128) (← links)
• Equilibria, fixed points, and complexity classes (Q458480) (← links)
• Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
• Quantitative fair simulation games (Q528184) (← links)
• Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
• A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
• On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
• On the complexity of core, kernel, and bargaining set (Q650525) (← links)
• Another sub-exponential algorithm for the simple stochastic game (Q652540) (← links)
• Qualitative reachability in stochastic BPA games (Q719240) (← links)
• On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
• Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
• Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
• General cops and robbers games with randomness (Q820532) (← links)
• Perfect information two-person zero-sum Markov games with imprecise transition probabilities (Q857945) (← links)
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
• Cyclic games and linear programming (Q944703) (← links)
• Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
• Strategy logic (Q979080) (← links)
• Verifying minimum stable circuit values (Q1007566) (← links)
• A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
• The complexity of mean payoff games on graphs (Q1351468) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
• Energy parity games (Q1758152) (← links)
• A delayed promotion policy for parity games (Q1784960) (← links)
• Comparison of algorithms for simple stochastic games (Q2105472) (← links)
• Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• Fixpoint theory -- upside down (Q2233395) (← links)
• Weighted modal transition systems (Q2248057) (← links)
• A survey of partial-observation stochastic parity games (Q2248075) (← links)
• Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519) (← links)
• Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
• A non-iterative algorithm for generalized pig games (Q2319668) (← links)
• The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
• Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
• A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← 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)