Effective learning in the presence of adaptive counterparts |
| |
Authors: | Andriy Burkov Brahim Chaib-draa |
| |
Affiliation: | aDAMAS Laboratory, Laval University, G1K 7P4, Quebec, Canada |
| |
Abstract: | Adaptive learning algorithms (ALAs) is an important class of agents that learn the utilities of their strategies jointly with the maintenance of the beliefs about their counterparts' future actions. In this paper, we propose an approach of learning in the presence of adaptive counterparts. Our Q-learning based algorithm, called Adaptive Dynamics Learner (ADL), assigns Q-values to the fixed-length interaction histories. This makes it capable of exploiting the strategy update dynamics of the adaptive learners. By so doing, ADL usually obtains higher utilities than those of equilibrium solutions. We tested our algorithm on a substantial representative set of the most known and demonstrative matrix games. We observed that ADL is highly effective in the presence of such ALAs as Adaptive Play Q-learning, Infinitesimal Gradient Ascent, Policy Hill-Climbing and Fictitious Play Q-learning. Further, in self-play ADL usually converges to a Pareto efficient average utility. |
| |
Keywords: | Multiagent learning Matrix games Adaptive learning algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|