Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities

This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in decision trees. More precisely, we investigate this problem from the computational viewpoint. When the decision tree is separable (to be defined in the paper), we provide an operational approach to compute an optimal strategy, based on a bicriteria dynamic programming procedure. The results of numerical tests are presented. When the decision tree is non-separable, we prove the NP-hardness of the problem. Key words: Sequential decision making; Imprecise probabilities; Hurwicz’s criterion; Computational complexity; Exact algorithms

• Type: Conference
• Year: 2009
• Where: ALDT
• Authors: Gildas Jeantet, Olivier Spanjaard
• Keywords: ALDT 2009, Algorithmic Decision Theory, Decision Tree, Imprecise Probabilities, Sequential Decision