Reachability and safety objectives in Markov decision processes on long but finite horizons
From MaRDI portal
Publication:2188953
DOI10.1007/s10957-020-01681-2zbMath1445.90114arXiv1911.05578OpenAlexW3027826968MaRDI QIDQ2188953
Arkadi Predtetchinski, Eilon Solan, Galit Ashkenazi-Golan, Janos Flesch
Publication date: 15 June 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.05578
Markov decision processPerron-Frobenius eigenvalueovertaking optimalityreachability objectivesafety objective
Related Items (2)
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs ⋮ Equilibrium in two-player stochastic games with shift-invariant payoffs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of stochastic \(\omega \)-regular games
- Criteria of optimality in the infinite-time optimal control problem
- Continuous-time Markov decision processes. Theory and applications
- A counterexample on overtaking optimality
- On equilibria in quantitative games with reachability/safety objectives
- Optimal choice for finite and infinite horizons
- Sporadic overtaking optimality in Markov decision problems
- Computer aided synthesis: a game-theoretic approach
- Turnpike phenomenon and infinite horizon optimal control
- Turnpike properties in the calculus of variations and optimal control
- Usual and stochastic tail orders between hitting times for two Markov chains
- Overtaking and Almost-Sure Optimality for Infinite Horizon Markov Decision Processes
- Variations on the Stochastic Shortest Path Problem
- Discrete Dynamic Programming
- Stochastic Games
- Percentile queries in multi-dimensional Markov decision processes
- On quantitative convergence to quasi-stationarity
This page was built for publication: Reachability and safety objectives in Markov decision processes on long but finite horizons
