Abstract:
To solve a stochastic zero sum game of two players an automaton pseudogradient type algorithm of learning is proposed where regularization ideas are employed. Sufficient conditions for convergence with a probability of one and for mean square convergence are given. Rates of convergence are estimated.