Model-Based Reinforcement Learning in Multiagent Systems with Sequential Action Selection

Abstract

SUMMARYModel-based reinforcement learning uses the gathered information, during each experience, more efficiently than model-free reinforcement learning. This is especially interesting in multiagent systems, since a large number of experiences are necessary to achieve a good performance. In this paper, model-based reinforcement learning is developed for a group of self-interested agents with sequential action selection based on traditional prioritized sweeping. Every single situation of decision making in this learning process, called extensive Markov game, is modeled as n-person general-sum extensive form game with perfect information. A modified version of backward induction is proposed for action selection, which adjusts the tradeoff between selecting subgame perfect equilibrium points, as the optimal joint actions, and learning new joint actions. The algorithm is proved to be convergent and discussed based on the new results on the convergence of the traditional prioritized sweeping. key words: multiagent systems, Markov games, model-based reinforcement learning, extensive form game

Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm

“…Asynchronous updates are also exploited in (Akramizadeh, Afshar, Menhaj, & Jafari, 2011;Moore & Atkeson, 1993), while a sequence of increasingly accurate approximate models is used in (Arruda, Ourique, LaCombe, & Almudevar, 2013).…”