Interactive Inverse Reinforcement Learning For Cooperative Games

Abstract

We study the problem of designing autonomous agents that can learn to cooperate effectively with a potentially suboptimal partner while having no access to the joint reward function. This problem is modeled as a cooperative episodic two-agent Markov decision process. We assume control over only the first of the two agents in a Stackelberg formulation of the game, where the second agent is acting so as to maximise expected utility given the first agent's policy. How should the first agent act in order to learn the joint reward function as quickly as possible and so that the joint policy is as close to optimal as possible? We analyse how knowledge about the reward function can be gained in this interactive two-agent scenario. We show that when the learning agent's policies have a significant effect on the transition function, the reward function can be learned efficiently.

Stats

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

Related papers

• Cooperative Inverse Reinforcement Learning (2016)0.00
• Learning To Share And Hide Intentions Using Information Regularization (2018)0.00
• Learning To Collaborate In Markov Decision Processes (2019)0.00
• Loss Aversion Fosters Coordination Among Independent Reinforcement Learners (2019)0.00
• Reciprocal Reward Influence Encourages Cooperation From Self-interested Agents (2024)1.91
• Multi-agent Cooperation Through Learning-aware Policy Gradients (2024)0.00
• On The Impossibility Of Learning To Cooperate With Adaptive Partner Strategies In Repeated Games (2022)0.00
• Imitation Learning Of Correlated Policies In Stackelberg Games (2025)0.00