arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.04564cs.AIcs.LG

Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomization

UC Berkeley(加州大学伯克利分校);UCSD(加利福尼亚大学圣地亚哥分校);CMU(卡内基梅隆大学);University of Washington(华盛顿大学);Tsinghua University(清华大学);Shanghai Qi Zhi Institute(上海期智研究院);Peking University(北京大学)

Zhenggang Tang, Chao Yu, Boyuan Chen, Huazhe Xu, Xiaolong Wang, Fei Fang, Simon Du, Yu Wang, Yi Wu

英文摘要:

We propose a simple, general and effective technique, Reward Randomization for discovering diverse strategic policies in complex multi-agent games. Combining reward randomization and policy gradient, we derive a new algorithm, Reward-Randomized Policy Gradient (RPG). RPG is able to discover multiple distinctive human-interpretable strategies in challenging temporal trust dilemmas, including grid-world games and a real-world game Agar.io, where multiple equilibria exist but standard multi-agent policy gradient algorithms always converge to a fixed one with a sub-optimal payoff for every player even using state-of-the-art exploration techniques. Furthermore, with the set of diverse strategies from RPG, we can (1) achieve higher payoffs by fine-tuning the best policy from the set; and (2) obtain an adaptive agent by using this set of strategies as its training opponents. The source code and example videos can be found in our website: https://sites.google.com/view/staghuntrpg.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑