In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property of compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum...

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property of compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum...

In this paper we review known minimax results with applications in game theory and show that these results are easy consequences of the first minimax result for a two person zero sum game with finite strategy sets published by von Neumann in 1928: Among these results are the well known minimax...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions onthe payoff function ƒ and/or extended to the larger set of the Borel probabilitymeasures instead of the set of mixed strategies.

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions onthe payoff function ƒ and/or extended to the larger set of the Borel probabilitymeasures instead of the set of mixed strategies.

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions onthe payoff function Æ’ and/or extended to the larger set of the Borel probabilitymeasures instead of the set of mixed strategies.

In this paper we review known minimax results with applications in game theory and show that these results are easy consequences of the first minimax result for a two person zero sum game with finite strategy sets published by von Neumann in 1928: Among these results are the well known minimax...