Bifurcation Analysis of Reinforcement Learning Agents in the Selten’s Horse Game
- Cite this paper as:
- Lazaric A., Munoz de Cote E., Dercole F., Restelli M. (2008) Bifurcation Analysis of Reinforcement Learning Agents in the Selten’s Horse Game. In: Tuyls K., Nowe A., Guessoum Z., Kudenko D. (eds) Adaptive Agents and Multi-Agent Systems III. Adaptation and Multi-Agent Learning. Lecture Notes in Computer Science, vol 4865. Springer, Berlin, Heidelberg
The application of reinforcement learning algorithms to multiagent domains may cause complex non-convergent dynamics. The replicator dynamics, commonly used in evolutionary game theory, proved to be effective for modeling the learning dynamics in normal form games. Nonetheless, it is often interesting to study the robustness of the learning dynamics when either learning or structural parameters are perturbed. This is equivalent to unfolding the catalog of learning dynamical scenarios that arise for all possible parameter settings which, unfortunately, cannot be obtained through “brute force” simulation of the replicator dynamics. The analysis of bifurcations, i.e., critical parameter combinations at which the learning behavior undergoes radical changes, is mandatory. In this work, we introduce a one-parameter bifurcation analysis of the Selten’s Horse game in which the learning process exhibits a set of complex dynamical scenarios even for relatively small perturbations on payoffs.
Unable to display preview. Download preview PDF.