Game problem of adaptive selection of versions and an algorithm for solving it (Q1057820)

A game problem of adaptive selection of versions is considered in a new formulation according to which a Nash equilibrium behavior is achieved with probability 1 under uncertainty. This problem can be solved with the aid of a simplified modification of a well-known algorithm of automaton type (without regularization) under much weaker constraints as compared to those stated by the author and \textit{A. S. Poznjak} [Ekonom. Mat. Metody 14, 958-968 (1978; Zbl 0407.90097)].