Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
From MaRDI portal
Publication:5883745
DOI10.46298/lmcs-19(1:16)2023OpenAlexW4323317293MaRDI QIDQ5883745
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.07079v4
Cites Work
- Markov decision processes with applications to finance.
- Optimal Markov strategies
- The existence of good Markov strategies for decision processes with general payoffs
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games
- Advances in dynamic games. Applications to economics, finance, optimization and stochastic control.
- Approximating the termination value of one-counter MDPs and stochastic games
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Recursive Markov Decision Processes and Recursive Stochastic Games
- Qualitative Analysis of VASS-Induced MDPs
- Energy and Mean-Payoff Parity Markov Decision Processes
- A Survey of Stochastic Games with Limsup and Liminf Objectives
- Handbook of Model Checking
- On the Existence of Stationary Optimal Strategies
- A survey of computational complexity results in systems and control
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs