This article is cited in 1 paper

Notes

On convergence of the Narendra-Shapiro automaton algorithm

A. V. Nazin, A. S. Poznyak

Moscow

Abstract: The convergence and rate of convergence of the Narendra-Shapiro automaton algorithm which rearranges the probabilities of choice of options for minimizing mean losses are investigated. The optimal parameters of the algorithm are determined.

UDC: 65.01


Received: 11.06.1981

Bibliographic databases:

•