In this paper we study some properties concerning the equilibrium point of a bimatrix game and describe a geometric method to obtain all the equilibria of a bimatrix game when one of the players has at most three pure strategies.
In this survey article we shall summarise some of the recent progress that has occurred in the study of topological games as well as their applications to abstract analysis. The topics given here do not necessarily represent the most important problems from the area of topological games, but rather, they represent a selection of problems that are of interest to the authors.
As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize -compactness amongst metrizable spaces. This is improved by showing that winning Markov strategies in the Menger game characterize -compactness amongst regular spaces, and that winning strategies may be improved to winning Markov strategies in second-countable spaces. An investigation of 2-Markov strategies introduces a new topological property between -compact and Menger spaces.