Lexicographic refinements in stationary possibilistic Markov decision processes

DOI10.1016/j.ijar.2018.10.011zbMath1448.68413OpenAlexW2897066576MaRDI QIDQ1726304

Nahla Ben Amor, Hélène Fargier, Zeineb El Khalfi, Régis Sabbadin

Publication date: 20 February 2019

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

Full work available at URL: http://oatao.univ-toulouse.fr/22626/1/benamor_22626.pdf

zbMATH Keywords

possibility theoryMarkov decision processlexicographic comparisonspossibilistic qualitative utilities

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Markov and semi-Markov decision processes (90C40)

Cites Work

• The \(K\)-armed dueling bandits problem
• Fuzzy sets as a basis for a theory of possibility
• Towards qualitative approaches to multi-stage decision making
• Decision making with imprecise probabilities and utilities by means of statistical preference and stochastic dominance
• Efficient policies for stationary possibilistic Markov decision processes
• Qualitative decision under uncertainty: back to expected utility
• Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs
• ON THE POSSIBILISTIC DECISION MODEL: FROM DECISION UNDER UNCERTAINTY TO CASE-BASED DECISION
• Decision-theoretic foundations of qualitative possibility theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item