About presentation of maximin in the game problem with constraints of asymptotic character

The abstract game problem of control and its relaxations connected with a weakening of constraints on the choice of programmed strategies are considered. In this case, the series of maximin problems is realized; for this series, the sets of admissible strategies of participants form directed systems. It is established that realized maximins are convergent. The representation of the corresponding generalized limit is established.