| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Learning Nash Equilibrium for General-Sum Markov Games from Batch Data
Abstract : This paper addresses the problem of learning a Nash equilibrium in γ-discounted mul-tiplayer general-sum Markov Games (MGs) in a batch setting. As the number of players increases in MG, the agents may either collaborate or team apart to increase their final rewards. One solution to address this problem is to look for a Nash equilibrium. Although , several techniques were found for the subcase of two-player zero-sum MGs, those techniques fail to find a Nash equilibrium in general-sum Markov Games. In this paper, we introduce a new definition of-Nash equilibrium in MGs which grasps the strategy's quality for multiplayer games. We prove that minimizing the norm of two Bellman-like residuals implies to learn such an-Nash equilibrium. Then, we show that minimizing an empirical estimate of the L p norm of these Bellman-like residuals allows learning for general-sum games within the batch setting. Finally, we introduce a neural network architecture that successfully learns a Nash equilibrium in generic multiplayer general-sum turn-based MGs.
Cited literature [26 references]
https://hal.inria.fr/hal-01648489
Contributor : Julien Pérolat <>
Submitted on : Sunday, November 26, 2017 - 1:37:11 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM
Contributor : Julien Pérolat <>
Submitted on : Sunday, November 26, 2017 - 1:37:11 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM
File
bellman-residual-aistats2016(5...
Files produced by the author(s)