arrow
返回

Exponential moving average based multiagent reinforcement learning algorithms

delete2015-10-19
delete13
PRE
AI
A
Awheda, Mostafa D. *
H
Howard M. Schwartz
DOI:10.1007/s10462-015-9447-5delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Two multi-agent policy iteration learning algorithms are proposed in this work. The two proposed algorithms use the exponential moving average approach along with the Q-learning algorithm as a basis to update the policy for the learning agent so that the agent's policy converges to a Nash equilibrium policy. The first proposed algorithm uses a constant learning rate when updating the policy of the learning agent, while the second proposed algorithm uses two different decaying learning rates. These two decaying learning rates are updated based on either the Win-or-Learn-Fast (WoLF) mechanism or the Win-or-Learn-Slow (WoLS) mechanism. The WoLS mechanism is introduced in this article to make the algorithm learn fast when it is winning and learn slowly when it is losing. The second proposed algorithm uses the rewards received by the learning agent to decide which mechanism (WoLF mechanism or WoLS mechanism) to use for the game being learned. The proposed algorithms have been theoretically analyzed and a mathematical proof of convergence to pure Nash equilibrium is provided for each algorithm. In the case of games with mixed Nash equilibrium, our mathematical analysis shows that the second proposed algorithm converges to an equilibrium. Although our mathematical analysis does not explicitly show that the second proposed algorithm converges to a Nash equilibrium, our simulation results indicate that the second proposed algorithm does converge to Nash equilibrium. The proposed algorithms are examined on a variety of matrix and stochastic games. Simulation results show that the second proposed algorithm converges in a wider variety of situations than state-of-the-art multi-agent reinforcement learning algorithms.
Keyword:
Multi-agent learning systems
Reinforcement learning
Markov decision processes
Nash equilibrium
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

C
carleton university
学者数:
7.5K
论文数: 8.3K
被引数: 5
引用论文

引用论文

Cranberry Anthocyanins
err2006-08-25
err0
PREAI
errC. ZAPSALIS; F. J. FRANCIS
err分享
err收藏
Batch and continuous of oil removal using organoclay and low-cost ceramic membrane
err2021-11-25
err0
errOAAI
errAna Beatriz de França Silva Araújo; Edilânia Silva do Carmo; Rochelia Silva Souza Cunha; Francisco Alex de Sousa Silva; Tellys Lins Almeida Barbosa; Meiry Gláucia Freire Rodrigues
err分享
err收藏
Mini‐Mental State Examination
err2002-04-30
err0
PREAI
errJoseph R. Cockrell; Marshal F. Folstein
err分享
err收藏
Fish scale of Sardina pilchardus as a biosorbent for the removal of Ponceau S dye from water: Experimental, designing and Monte Carlo investigations
err2022-03-01
err0
errOAAI
errAdil Jaafar; André Darchen; Anas Driouich; Zouhair Lakbaibi; Abdelghani Boussaoud; Baylassane Chatib; Yasmine Laftani; Mohammed El Makhfouk; Mohsine Hachkar
err分享
err收藏
err分享
err收藏
Evaluating the concentrations of total mercury, methylmercury, selenium, and selenium:mercury molar ratios in traditional foods of the Bigstone Cree in Alberta, Canada
err2020-07-01
err0
PREAI
errNasrin Golzadeh; Benjamin D. Barst; Niladri Basu; Janelle M. Baker; Josie C. Auger; Melissa A. McKinney
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容