Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
This paper provides a self-contained definition and a characterization of the class of extensive form games that are adequate for applications, but still do not employ any finiteness assumptions. In spite of its simplicity, the resulting definition is more general than the classical ones. Moreover, we show that this class satisfies the basic desiderata that strategies induce outcomes and do so uniquely. Within the class of playable extensive forms, the characterization is by the existence of an immediate predecessor function on the set of moves. Copyright Springer-Verlag 2013