From Game-theoretic Multi-agent Log Linear Learning To Reinforcement Learning

Abstract

The main focus of this paper is on enhancement of two types of game-theoretic learning algorithms: log-linear learning and reinforcement learning. The standard analysis of log-linear learning needs a highly structured environment, i.e. strong assumptions about the game from an implementation perspective. In this paper, we introduce a variant of log-linear learning that provides asymptotic guarantees while relaxing the structural assumptions to include synchronous updates and limitations in information available to the players. On the other hand, model-free reinforcement learning is able to perform even under weaker assumptions on players' knowledge about the environment and other players' strategies. We propose a reinforcement algorithm that uses a double-aggregation scheme in order to deepen players' insight about the environment and constant learning step-size which achieves a higher convergence rate. Numerical experiments are conducted to verify each algorithm's robustness and perfo

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhasanbeig2018from

Related papers

• Game Theory And Multi-agent Reinforcement Learning : From Nash Equilibria To Evolutionary Dynamics (2024)0.00
• A Law Of Iterated Logarithm For Multi-agent Reinforcement Learning (2021)0.00
• Extended Markov Games To Learn Multiple Tasks In Multi-agent Reinforcement Learning (2020)3.58
• Algorithms In Multi-agent Systems: A Holistic Perspective From Reinforcement Learning And Game Theory (2020)0.00
• Robust Cooperative Multi-agent Reinforcement Learning:a Mean-field Type Game Perspective (2024)0.00
• Deep Multiagent Reinforcement Learning: Challenges And Directions (2021)0.00
• Provably Efficient Generalized Lagrangian Policy Optimization For Safe Multi-agent Reinforcement Learning (2023)0.00
• A Black-box Approach For Non-stationary Multi-agent Reinforcement Learning (2023)0.00