all AI news
A Deep Reinforcement Learning Approach for Finding Non-Exploitable Strategies in Two-Player Atari Games. (arXiv:2207.08894v2 [cs.LG] UPDATED)
Oct. 3, 2022, 1:12 a.m. | Zihan Ding, Dijia Su, Qinghua Liu, Chi Jin
cs.LG updates on arXiv.org arxiv.org
This paper proposes novel, end-to-end deep reinforcement learning algorithms
for learning two-player zero-sum Markov games. Different from prior efforts on
training agents to beat a fixed set of opponents, our objective is to find the
Nash equilibrium policies that are free from exploitation by even the
adversarial opponents. We propose (1) Nash DQN algorithm, which integrates DQN
with a Nash finding subroutine for the joint value functions; and (2) Nash DQN
Exploiter algorithm, which additionally adopts an exploiter for guiding …
arxiv atari games games reinforcement reinforcement learning strategies
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
DevOps Engineer (Data Team)
@ Reward Gateway | Sofia/Plovdiv