Strategy complexity of reachability in countable stochastic 2-player games

Strategy complexity of reachability in countable stochastic 2-player games

We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of ε-optimal (resp. optimal) strategies. These results depend on the size of the players’ action sets and on whether one requires strategies that are...

Bibliografski detalji
Glavni autori:	Kiefer, S, Mayr, R, Shirmohammadi, M, Totzke, P
Format:	Journal article
Jezik:	English
Izdano:	Springer Nature 2024

Slični predmeti

Strategy complexity of parity objectives in countable MDPs
od: Kiefer, S, i dr.
Izdano: (2020)

On strong determinacy of countable stochastic games
od: Kiefer, S, i dr.
Izdano: (2017)

Büchi objectives in countable MDPs
od: Kiefer, S, i dr.
Izdano: (2019)

Transience in countable MDPs
od: Kiefer, SM, i dr.
Izdano: (2021)

Parity objectives in countable MDPs
od: Kiefer, S, i dr.
Izdano: (2017)

Reachability in Stochastic Timed Games.
od: Bouyer, P, i dr.
Izdano: (2009)

Stochastic reachability analysis in complex biological networks
od: El-Samad, H, i dr.
Izdano: (2006)

Continuous-Time Stochastic Games with Time-Bounded Reachability.
od: Brázdil, T, i dr.
Izdano: (2009)

On affine reachability problems
od: Jaax, S, i dr.
Izdano: (2020)

Revisiting reachability in timed automata
od: Quaas, K, i dr.
Izdano: (2017)

PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives
od: Kwiatkowska, M, i dr.
Izdano: (2017)

Expected Reachability-Time Games.
od: Forejt, V, i dr.
Izdano: (2010)

A polynomial-time algorithm for reachability in branching VASS in dimension one
od: Göller, S, i dr.
Izdano: (2016)

Expected Reachability−Time Games
od: Forejt, V, i dr.
Izdano: (2010)

Expected reachability-time games
od: Forejt, V, i dr.
Izdano: (2016)

Multi-player equilibria verification for concurrent stochastic games
od: Kwiatkowska, M, i dr.
Izdano: (2020)

Monotone countable paracompactness
od: Good, C, i dr.
Izdano: (2000)

Reachability−Time Games on Timed Automata
od: Jurdzinski, M, i dr.
Izdano: (2007)

An Effective Representation of the Reachability Set of Persistent Petri Nets
od: Mayr, Ernst
Izdano: (2023)

The reachability problem for two-dimensional vector addition systems with states
od: Blondin, M, i dr.
Izdano: (2021)

The point−countable base problem
od: Rosoce, A, i dr.
Izdano: (1990)

Approximating countable Markov chains/
od: Freedman, David, 1938-
Izdano: (1972)

Gibbs states on countable sets /
Izdano: (1974)

Optimal strategies of players in linear differential games.
od: Salimi, Mehdi
Izdano: (2011)

Spaces of functions with countably many discontinuities
od: Haydon, R, i dr.
Izdano: (2007)

Using an ontology to determine English countability
od: Bond, Francis, i dr.
Izdano: (2011)

Is there a countable omega-universal logic?
od: Paseau, A, i dr.
Izdano: (2025)

Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
od: Abate, A, i dr.
Izdano: (2008)

Probabilistic Reachability and Safety for Controlled Discrete Time Stochastic Hybrid Systems
od: Abate, A, i dr.
Izdano: (2008)

Single-Player and Two-Player Buttons & Scissors Games
od: Burke, Kyle, i dr.
Izdano: (2018)

Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games
od: Jovanović, A, i dr.
Izdano: (2013)

On the complexity of value iteration
od: Balaji, N, i dr.
Izdano: (2019)

Functional Reachability
od: Ong, C, i dr.
Izdano: (2009)

No pre-games for players, no problem
od: Azharie, Farah
Izdano: (2017)

A game for VR players
od: Tang, Heem Yew
Izdano: (2021)

A plethora of methods for learning English countability
od: Baldwin, Timothy, i dr.
Izdano: (2011)

Gameplay socialization : meaning-making, player-computer and player-player interaction in digital games
od: David Kirschner
Izdano: (2014)

The complexity of decision problems about equilibria in two-player Boolean games
od: Ianovski, E, i dr.
Izdano: (2018)

Vector reachability problem in SL (2, ℤ)
od: Potapov, I, i dr.
Izdano: (2016)

Finding optimal strategies for influencing social networks in two player games
od: Howard, Nicholas J. (Nicholas Jacob)
Izdano: (2011)