Reduction of Silverman-like games to games on bounded sets (Q1121809)

The paper concerns two-person zero-sum games in which the strategy sets are sets of real numbers bounded from below, payoff functions are bounded, and the achievement of the maximum or minimum payoffs depends on the relation between the strategies (i.e. numbers) chosen by both players. It is shown that for the discrete strategy sets the game can be reduced to a game over finite sets of strategies.