Abstract
In Section 1.2 we briefly indicated that learning automata are useful in applications that involve optimization of a function which is not completely known in the sense that only noise corrupted values of the function for any specific values of arguments are observable. Suppose we want to find the maximum of a function f: ℜ → ℜ given only noise corrupted observations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Thathachar, M.A.L., Sastry, P.S. (2004). Games of Learning Automata. In: Networks of Learning Automata. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9052-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9052-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4775-0
Online ISBN: 978-1-4419-9052-5
eBook Packages: Springer Book Archive