Meta-game Equilibrium for Multi-agent Reinforcement Learning
Lists
Only you see this
Abstract
This paper proposes a multi-agent Q-learning algorithm called meta-game-Q learning that is developed from the meta-game equilibrium concept. Different from Nash equilibrium, meta-game equilibrium can achieve the optimal joint action game through deliberating its preference and predicting others’ policies in the general-sum game. A distributed negotiation algorithm is used to solve the meta-game equilibrium problem instead of using centralized linear programming algorithms. We use the repeated prisoner’s dilemma example to empirically demonstrate that the algorithm converges to meta-game equilibrium.
BibTeX
@inproceedings{gao2004meta,
author = {Yang Gao and Joshua Zhexue Huang and Hongqiang Rong and Zhi-Hua Zhou},
title = {{Meta-game Equilibrium for Multi-agent Reinforcement Learning}},
booktitle = {Australian Conference on Artificial Intelligence},
year = {2004},
doi = {10.1007/978-3-540-30549-1\_81},
}Loading related content...