Abstract

This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms.

Keywords

Computer science

Affiliated Institutions

Related Publications

The Theory of Quantum Information

This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of th...

2018 Cambridge University Press eBooks 1237 citations

Metaverse

The Metaverse is the post-reality universe, a perpetual and persistent multiuser environment merging physical reality with digital virtuality. It is based on the convergence of ...

2022 Encyclopedia 1660 citations

Game Theory for Political Scientists

Game theory is the mathematical analysis of strategic interaction. In the fifty years since the appearance of von Neumann and Morgenstern's classic Theory of Games and Economic ...

1995 Princeton University Press eBooks 795 citations

Publication Info

Year
1989
Type
book
Citations
1559
Access
Closed

External Links

Citation Metrics

1559
OpenAlex

Cite This

Kumpati S. Narendra, Mandayam A. L. Thathachar (1989). Learning Automata: An Introduction. CERN Document Server (European Organization for Nuclear Research) .