Bounds on the Convergence Probabilities of Learning Automata

DOI10.1109/TSMC.1976.4309449zbMath0351.94040OpenAlexW2226049968MaRDI QIDQ4121843

S. Lakshmivarahan, M. A. L. Thathachar

Publication date: 1976

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.1976.4309449

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ Absolute expediency of learning automata ⋮ Convergence in models with bounded expected relative hazard rates ⋮ Clustering the wireless ad hoc networks: a distributed learning automata approach ⋮ Asymptotic behaviour of a learning algorithm ⋮ Finding minimum weight connected dominating set in stochastic graph based on learning automata ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ A cooperative game of a pair of learning automata ⋮ epsilon-optimality of a general class of learning algorithms ⋮ The use of learning algorithms in telephone traffic routing - a methodology

This page was built for publication: Bounds on the Convergence Probabilities of Learning Automata