Learning automata processing ergodicity of the mean: The two-action case
From MaRDI portal
Publication:3323275
DOI10.1109/TSMC.1983.6313191zbMath0537.68052OpenAlexW2054050602WikidataQ60328404 ScholiaQ60328404MaRDI QIDQ3323275
M. A. L. Thathachar, B. John Oommen
Publication date: 1983
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1983.6313191
rate of convergencelinear algorithmLearning automataaction probabilityergodicity of the meannonlinear updating schemestwo-action case
Related Items (2)
History dependent stochastic automata: A formal view of evolutionary learning ⋮ Multiaction learning automata possessing ergodicity of the mean
This page was built for publication: Learning automata processing ergodicity of the mean: The two-action case