Independent Learning In Stochastic Games

Abstract

Reinforcement learning (RL) has recently achieved tremendous successes in many artificial intelligence applications. Many of the forefront applications of RL involve multiple agents, e.g., playing chess and Go games, autonomous driving, and robotics. Unfortunately, the framework upon which classical RL builds is inappropriate for multi-agent learning, as it assumes an agent's environment is stationary and does not take into account the adaptivity of other agents. In this review paper, we present the model of stochastic games for multi-agent learning in dynamic environments. We focus on the development of simple and independent learning dynamics for stochastic games: each agent is myopic and chooses best-response type actions to other agents' strategy without any coordination with her opponent. There has been limited progress on developing convergent best-response type independent learning dynamics for stochastic games. We present our recently proposed simple and independent learning dy

Stats

• citations7
• S2 citations—
• github stars0
• HF likes0
• heat score6.77
• arxiv keyozdaglar2021independent

Related papers

• Deterministic Limit Of Temporal Difference Reinforcement Learning For Stochastic Games (2018)12.93
• Decentralized Multi-agent Reinforcement Learning For Continuous-space Stochastic Games (2023)5.24
• DSDF: An Approach To Handle Stochastic Agents In Collaborative Multi-agent Reinforcement Learning (2021)0.00
• The Evolutionary Dynamics Of Independent Learning Agents In Population Games (2020)0.00
• Independent And Decentralized Learning In Markov Potential Games (2022)0.00
• Algorithms In Multi-agent Systems: A Holistic Perspective From Reinforcement Learning And Game Theory (2020)0.00
• A Survey Of Learning In Multiagent Environments: Dealing With Non-stationarity (2017)0.00
• Multi-agent Reinforcement Learning: A Selective Overview Of Theories And Algorithms (2019)21.85