Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected mean-payoff....
Main Authors: | Aaron Bohy, Véronique Bruyère, Jean-François Raskin |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1407.5396v1 |
Similar Items
-
Complete monotone coupling for Markov processes
by: Pra, Paolo Dai, et al.
Published: (2008) -
Monotonicity and complete monotonicity for continuous-time Markov chains
by: Dai Pra, Paolo, et al.
Published: (2006) -
Strategy iteration algorithms for games and Markov decision processes
by: Fearnley, John
Published: (2010) -
Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization
by: Abdulla, Mohammed Shahid
Published: (2010) -
Algorithmic aspects of mean-variance optimization in Markov decision processes
by: Tsitsiklis, John N, et al.
Published: (2017)