A game problem of adaptive choice and an algorithm of its solution

The game problem of adaptive choice is restated as that of obtaining almost surely a Nash equilibrium behaviour under uncertainty and is shown to be solvable by a simplified modification of the well-known automation algorithm (without regularization) with constraints significantly less stringent than those the reported in [1].