This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payoffs 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...

This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payoffs 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...

Since the seminal paper of Nash (Proc Natl Acad Sci USA 36:48–49, <CitationRef CitationID="CR12">1950</CitationRef>) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. In a recent paper of Pruzhansky (Int J Game Theory 40:351–365, <CitationRef CitationID="CR17">2011</CitationRef>) it was shown that under fairy general conditions...</citationref></citationref>

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

This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payoffs 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...