We characterize strategy sets that are closed under rational behavior (curb) in extensive games of perfect information and finite horizon. It is shown that any such game possesses only one minimal curb set, which necessarily includes all its subgame perfect Nash equilibria. Applications of this...

This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payo.s as mixed Nash equilibrium strategies in bimatrix games. We present a discussion on the applicability of maximin strategies in such class of games. The usefulness of...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function <i>f</i> and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.