13 citations · 18 across the 3 of their papers we have counts for
3 papers
math.ST2012
Identifying subtree perfectness in decision trees
Nathan Huntley, Matthias C. M. Troffaes
In decision problems, often, utilities and probabilities are hard to determine. In such cases, one can resort to so-called choice functions. They provide a means to determine which…
math.ST2011★ 5 cited
Subtree perfectness, backward induction, and normal-extensive form equivalence for single agent sequential decision making under arbitrary choice functions
Nathan Huntley, Matthias C. M. Troffaes
We revisit and reinterpret Selten's concept of subgame perfectness in the context of single agent normal form sequential decision making, which leads us to the concept of subtree p…
math.ST2011★ 13 cited
Normal form backward induction for decision trees with coherent lower previsions
Nathan Huntley, Matthias C. M. Troffaes
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 strategi…