Strategy complexity of reachability in countable stochastic 2-player games
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3128726 (Why is no real title available?)
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 4202070 (Why is no real title available?)
- scientific article; zbMATH DE number 4025193 (Why is no real title available?)
- scientific article; zbMATH DE number 3777289 (Why is no real title available?)
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1099351 (Why is no real title available?)
- scientific article; zbMATH DE number 2013849 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 836582 (Why is no real title available?)
- scientific article; zbMATH DE number 893883 (Why is no real title available?)
- scientific article; zbMATH DE number 7559495 (Why is no real title available?)
- scientific article; zbMATH DE number 7561612 (Why is no real title available?)
- A finite algorithm for the switching control stochastic game
- Advances in dynamic games. Applications to economics, finance, optimization and stochastic control.
- Characterization and simplification of optimal strategies in positive stochastic games
- Concurrent reachability games
- Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic Games
- Finitely additive stochastic games with Borel measurable payoffs
- How to play in infinite MDPs (invited talk)
- On strong determinacy of countable stochastic games
- On the Existence of Stationary Optimal Strategies
- On the existence of good stationary strategies for nonleavable stochastic games
- Optimal strategies in concurrent reachability games
- Ordered field property for stochastic games when the player who controls transitions changes from state to state
- PRISM-games: a model checker for stochastic multi-player games
- Parity objectives in countable MDPs
- Positive zero-sum stochastic games with countable state and action spaces
- Qualitative determinacy and decidability of stochastic games with signals
- Qualitative reachability in stochastic BPA games
- Quantitative verification and strategy synthesis for stochastic games
- Reachability in networks of register protocols under stochastic schedulers
- Set Theory
- Solving simple stochastic tail games
- Stationary Strategies for Recursive Games
- Stochastic Games
- Stochastic games
- Stochastic games with unbounded payoffs: applications to robust control in economics
- Subgame maxmin strategies in zero-sum stochastic games with tolerance levels
- Subgame-Perfect Equilibria for Stochastic Games
- The Big Match
- The complexity of stochastic games
- The determinacy of Blackwell games
- Turn-based stochastic games
- Two-person zero-sum stochastic games with semicontinuous payoff
- Zero-reachability in probabilistic multi-counter automata
- Zero-sum constrained stochastic games with independent state processes
This page was built for publication: Strategy complexity of reachability in countable stochastic 2-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945915)