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

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

In a (generalized) symmetric aggregative game, payoffs depend only on individual strategy and an aggregate of all strategies. Players behaving as if they were negligible would optimize taking the aggregate as given. We provide evolutionary and dynamic foundations for such behavior when the game...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius–coradius result for robust...