Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities

DOI10.1007/978-3-642-04428-1_30zbMath1260.91060OpenAlexW32784837MaRDI QIDQ3645328

Olivier Spanjaard, Gildas Jeantet

Publication date: 17 November 2009

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04428-1_30

zbMATH Keywords

computational complexityimprecise probabilitiesexact algorithmssequential decision makingHurwicz's criterion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decision theory (91B06) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A framework for sensitivity analysis of decision trees ⋮ Reducing Interval-Valued Decision Trees to Conventional Ones: Comments on Decision Trees with Single and Multiple Interval-Valued Objectives ⋮ Total orderings defined on the set of all fuzzy numbers

This page was built for publication: Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities