Necessity-based Choquet integrals for sequential decision making under uncertainty

Authors:
Nahla Ben Amor;Hélène Fargier;Wided Guezguez
Affiliations:
LARODEC, Institut Superieur de Gestion Tunis, Tunisie;IRIT, CNRS, UMR, Université de Toulouse, France;LARODEC, Institut Superieur de Gestion Tunis, Tunisie
Venue:
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Year:
2010

Citing 3
Cited 0

Possibilistic Influence Diagrams

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Possibility theory as a basis for qualitative decision theory

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Possibilistic decision theory is a natural one to consider when information about uncertainty cannot be quantified in probabilistic way. Different qualitative criteria based on possibility theory have been proposed the definition of which requires a finite ordinal, non compensatory, scale for evaluating both utility and plausibility. In presence of heterogeneous information, i.e. when the knowledge about the state of the world is modeled by a possibility distribution while the utility degrees are numerical and compensatory, one should rather evaluate each decision on the basis of its Necessity-based Choquet value. In the present paper, we study the use of this criterion in the context of sequential decision trees. We show that it does not satisfy the monotonicity property on which rely the dynamic programming algorithms classically associated to decision trees. Then, we propose a Branch and Bound algorithm based on an optimistic evaluation of the Choquet value.