Efficient algorithms for risk-sensitive Markov decision processes with limited budget

DOI10.1016/j.ijar.2021.09.003OpenAlexW3200473303MaRDI QIDQ2060792

Denis Deratani Mauá, Daniel A. Melo Moreira, Leliane Nunes de Barros, Karina Valdivia Delgado

Publication date: 13 December 2021

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2021.09.003

zbMATH Keywords

Markov decision processesprobabilistic planningrisk-sensitive Markov decision processes

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization models for the first arrival target distribution function in discrete time
• Stochastic dynamic programming with factored representations
• Optimal policy for minimizing risk models in Markov decision processes
• Minimising a threshold probability in discounted Markov decision processes
• Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art
• Introduction to Stochastic Programming
• Multiplicative Markov Decision Chains
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• Variance-Penalized Markov Decision Processes
• A Utility Criterion for Markov Decision Processes
• The variance of discounted Markov decision processes
• Percentile performance criteria for limiting average Markov decision processes
• Risk-Sensitive Markov Decision Processes
• On terminating Markov decision processes with a risk-averse objective function

This page was built for publication: Efficient algorithms for risk-sensitive Markov decision processes with limited budget