Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities
Daniel Kikuti, Fábio Gagliardi Cozman, Cassio Polpo de Campos · Research Portal (Queen's University Belfast) · 2005
Partially ordered preferences generally lead to choices that do not abide by standard expected util-ity guidelines; often such preferences are revealed by imprecision in probability values. We investi-gate ve criteria for strategy selection in decision trees with imprecision in probabilities: extensive -maximin and -maximax, interval dominance, maximality and E-admissibility. We present algo-rithms that generate strategies for all these crite-ria; our main contribution is an algorithm for E-admissibility that runs over admissible strategies rather than over sets of probability distributions. 1