We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Normal form backward induction for decision trees with coherent lower previsions.

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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:The original publication is available at
Date accepted:No date available
Date deposited:05 April 2012
Date of first online publication:2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar