Learning To Share And Hide Intentions Using Information Regularization

Abstract

Learning to cooperate with friends and compete with foes is a key component of multi-agent reinforcement learning. Typically to do so, one requires access to either a model of or interaction with the other agent(s). Here we show how to learn effective strategies for cooperation and competition in an asymmetric information game with no such model or interaction. Our approach is to encourage an agent to reveal or hide their intentions using an information-theoretic regularizer. We consider both the mutual information between goal and action given state, as well as the mutual information between goal and state. We show how to optimize these regularizers in a way that is easy to integrate with policy gradient reinforcement learning. Finally, we demonstrate that cooperative (competitive) policies learned with our approach lead to more (less) reward for a second agent in two simple asymmetric information games.

Stats

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

Related papers

• Multi-agent Cooperation Through Learning-aware Policy Gradients (2024)0.00
• Interactive Inverse Reinforcement Learning For Cooperative Games (2021)0.00
• Robust Multi-agent Reinforcement Learning By Mutual Information Regularization (2023)0.00
• Promoting Coordination Through Policy Regularization In Multi-agent Deep Reinforcement Learning (2019)0.00
• On Information Asymmetry In Competitive Multi-agent Reinforcement Learning: Convergence And Optimality (2020)0.00
• Iterated Reasoning With Mutual Information In Cooperative And Byzantine Decentralized Teaming (2022)0.00
• Cautiously-optimistic Knowledge Sharing For Cooperative Multi-agent Reinforcement Learning (2023)5.84
• Cooperation And Reputation Dynamics With Reinforcement Learning (2021)3.58