Skip to Main content Skip to Navigation
Conference papers

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.
Keywords : Decision tree
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01445237
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Wednesday, February 8, 2017 - 9:26:09 AM
Last modification on : Monday, July 4, 2022 - 10:29:20 AM
Long-term archiving on: : Tuesday, May 9, 2017 - 12:17:53 PM

File

benamor_17215.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01445237, version 1
  • OATAO : 17215

Citation

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. ⟨hal-01445237⟩

Share

Metrics

Record views

198

Files downloads

77