The traditional model of sequential decision making, for instance, in extensive form games, is a tree. Most texts define a tree as a connected directed graph without loops and a distinguished node, called the root. But an abstract graph is not a domain for decision theory. Decision theory...

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...

This book treats extensive form game theory in full generality. It provides a framework that does not rely on any finiteness assumptions at all, yet covers the finite case. The presentation starts by identifying the appropriate concept of a game tree. This concept represents a synthesis of...