Parity objectives in countable MDPs
<p>We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski hierarchy (including reachability, safety, Büchi and co-Büchi).</p> <br/> <p>In finite MDPs there always exist optimal memoryless deterministic (MD)...
Huvudupphovsmän: | Kiefer, S, Mayr, R, Shirmohammadi, M, Wojtczak, D |
---|---|
Materialtyp: | Conference item |
Publicerad: |
Institute for Electrical and Electronics Engineers
2017
|
Liknande verk
Liknande verk
-
Strategy complexity of parity objectives in countable MDPs
av: Kiefer, S, et al.
Publicerad: (2020) -
Büchi objectives in countable MDPs
av: Kiefer, S, et al.
Publicerad: (2019) -
Transience in countable MDPs
av: Kiefer, SM, et al.
Publicerad: (2021) -
On strong determinacy of countable stochastic games
av: Kiefer, S, et al.
Publicerad: (2017) -
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
av: Richard Mayr, et al.
Publicerad: (2023-03-01)