Huntley, Nathan and Troffaes, Matthias C. M. (2012) 'Normal form backward induction for decision trees with coherent lower previsions.', Annals of operations research., 195 (1). pp. 111-134.
We examine normal form solutions of decision trees under typical choice functions induced by lower previsions. For large trees, finding such solutions is hard as very many strategies must be considered. In an earlier paper, we extended backward induction to arbitrary choice functions, yielding far more efficient solutions, and we identified simple necessary and sufficient conditions for this to work. In this paper, we show that backward induction works for maximality and E-admissibility, but not for interval dominance and Gamma-maximin. We also show that, in some situations, a computationally cheap approximation of a choice function can be used, even if the approximation violates the conditions for backward induction; for instance, interval dominance with backward induction will yield at least all maximal normal form solutions.
|Full text:||PDF - Accepted Version (388Kb)|
|Publisher Web site:||http://dx.doi.org/10.1007/s10479-011-0968-2|
|Publisher statement:||The original publication is available at www.springerlink.com|
|Record Created:||03 Apr 2012 14:05|
|Last Modified:||05 Apr 2012 15:23|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|