Lexicographic refinements in possibilistic decision trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Lexicographic refinements in possibilistic decision trees

Abstract

Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refinements to possibilistic decision trees. We show, in particular, that they still benefit from an Expected Utility (EU) grounding. We also provide qualitative dynamic programming algorithms to compute lexicographic optimal strategies. The paper is completed with an experimental study that shows the feasibility and the interest of the approach.
Fichier principal
Vignette du fichier
benamor_17215.pdf (240.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01445237 , version 1 (08-02-2017)

Licence

Attribution

Identifiers

Cite

Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin. Lexicographic refinements in possibilistic decision trees. European Conference on Artificial Intelligence (ECAI 2016), Aug 2016, La Hague, France. pp.202-208, ⟨10.3233/978-1-61499-672-9-202⟩. ⟨hal-01445237⟩
228 View
94 Download

Altmetric

Share

Gmail Facebook X LinkedIn More