On the rate of convergence and choice of parameters for an automaton algorithm

In the problem of adaptive choice of options the mean losses have to be minimized. An automaton algorithm is proposed for its solution which is an extension of the well-known algorithm of the method of stochastic approximation. Mean square convergence conditions are derived; the rate of convergence is estimated; and optimal and guaranteeing algorithm parameters are determined.