Lexicographic refinements in stationary possibilistic Markov decision processes
type: Item
instance of: scholarly article
title: Lexicographic refinements in stationary possibilistic Markov decision processes
zbMATH Open document ID: 1448.68413
author: Nahla Ben Amor
author: Zeineb El Khalfi
author: Hélène Fargier
author: Régis Sabbadin
published in: International Journal of Approximate Reasoning
publication date: 2019-02-20T00:00:00Z
full work available at URL: benamor 22626.pdf
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 7025897
zbMATH Keywords: Markov decision process
zbMATH Keywords: possibility theory
zbMATH Keywords: lexicographic comparisons
zbMATH Keywords: possibilistic qualitative utilities
MaRDI profile type: Publication
OpenAlex ID: W2897066576
cites work: Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs
cites work: Q3241581
cites work: Q3245701
cites work: Efficient policies for stationary possibilistic Markov decision processes
cites work: ON THE POSSIBILISTIC DECISION MODEL: FROM DECISION UNDER UNCERTAINTY TO CASE-BASED DECISION
cites work: Q4039980
cites work: Decision-theoretic foundations of qualitative possibility theory
cites work: Qualitative decision under uncertainty: back to expected utility
cites work: Q3266141
cites work: Decision making with imprecise probabilities and utilities by means of statistical preference and stochastic dominance
cites work: Q3993509
cites work: Q5844986
cites work: Q4315289
cites work: Towards qualitative approaches to multi-stage decision making
cites work: Q4403141
cites work: Q5637724
cites work: Q4346194
cites work: The \(K\)-armed dueling bandits problem
cites work: Fuzzy sets as a basis for a theory of possibility
DOI: 10.1016/J.IJAR.2018.10.011
description: scientific article; zbMATH DE number 7025897