Search

This paper considers the condition of perfect recall for the class of arbitrarily large discrete extensive form games. The known definitions of perfect recall are shown to be equivalent even beyond finite games. Further, a qualitatively new characterization in terms of choices is obtained. In particular, an extensive form game satisfies perfect recall if and only if the set of choices, viewed as sets of ultimate outcomes, fulfill the 'Trivial Intersection' property, that is, any two choices with nonempty intersection are ordered by set inclusion. [ABSTRACT FROM AUTHOR]