Sciweavers

Share
AAMAS
2007
Springer

Networks of Learning Automata and Limiting Games

10 years 10 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that a set of decentralized, independent learning automata is able to control a finite Markov Chain with unknown transition probabilities and rewards. This result was recently extended to Markov Games and analyzed with the use of limiting games. In this paper we continue this analysis but we assume here that our agents are fully ignorant about the other agents in the environment, i.e. they can only observe themselves; they do not know how many other agents are present in the environment, the actions these other agents took, the rewards they received for this, or the location they occupy in the state space. We prove that in Markov Games, where agents have this limited type of observability, a network of independent LA is still able to converge to an equilibrium point of the underlying limiting game, provided a co...
Peter Vrancx, Katja Verbeeck, Ann Nowé
Added 06 Jun 2010
Updated 06 Jun 2010
Type Conference
Year 2007
Where AAMAS
Authors Peter Vrancx, Katja Verbeeck, Ann Nowé
Comments (0)
books