Yu. V. Averboukh
16, S.Kovalevskaja street, 620219, Ekaterinburg GSP-384, RUSSIA,
Institute of Mathematics and Mechanics,
Ural Branch of the Russian Academy of Sciences,
The game-theoretical problem of approach is under consideration. The approach problem
``by the moment'' for an autonomous conflict controlled system is transformed to the
approach problem ``at the moment'' for a extended system.
A variant of a programmed iteration method (iteration of stability) is studied. A.G.
Chentsov proved that the sequence of sets converge to the set of successful solvability
of approach problem. The coincidence of corresponding iterations is proved; therefore the
coincidence of successful solvability sets follows. It is established that if the start
system satisfy the Isaacs condition then the transformed system satisfy this condition
too.