Trees and extensive forms

This paper addresses the question of what it takes to obtain a well-defined extensive form game. Without relying on simplifying finiteness or discreteness assumptions, we characterize the class of game trees for which all pure strategy combinations induce unique outcomes. The generality of the set-up covers “exotic” cases, like stochastic games or decision problems in continuous time (differential games). We find that the latter class, though a well-defined problem, fails this test.