Moody Learners -- Explaining Competitive Behaviour Of Reinforcement Learning Agents

Abstract

Designing the decision-making processes of artificial agents that are involved in competitive interactions is a challenging task. In a competitive scenario, the agent does not only have a dynamic environment but also is directly affected by the opponents' actions. Observing the Q-values of the agent is usually a way of explaining its behavior, however, do not show the temporal-relation between the selected actions. We address this problem by proposing the *Moody framework*. We evaluate our model by performing a series of experiments using the competitive multiplayer Chef's Hat card game and discuss how our model allows the agents' to obtain a holistic representation of the competitive dynamics within the game.

Stats

• citations11
• S2 citations—
• github stars0
• HF likes0
• heat score8.09
• arxiv keybarros2020moody

Related papers

• All By Myself: Learning Individualized Competitive Behaviour With A Contrastive Reinforcement Learning Optimization (2023)7.16
• Learning From Learners: Adapting Reinforcement Learning Agents To Be Competitive In A Card Game (2020)0.00
• Understanding Individual Decision-making In Multi-agent Reinforcement Learning: A Dynamical Systems Approach (2025)0.00
• An Active Learning Method For Solving Competitive Multi-agent Decision-making And Control Problems (2022)3.58
• Competitive Multi-agent Deep Reinforcement Learning With Counterfactual Thinking (2019)7.16
• Mimicking To Dominate: Imitation Learning Strategies For Success In Multiagent Competitive Games (2023)0.00
• Stability Of Multi-agent Learning In Competitive Networks: Delaying The Onset Of Chaos (2023)0.00
• Beyond Strict Competition: Approximate Convergence Of Multi Agent Q-learning Dynamics (2023)0.00