A Game-Theoretic Model and Best-Response Learning Method for Ad Hoc Coordination in Multiagent Systems
The ad hoc coordination problem is to design an autonomous agent which is able to achieve optimal flexibility and efficiency in a multiagent system with no mechanisms for prior coordination. We conceptualise this problem formally using a game-theoretic model, called the stochastic Bayesian game, in which the behaviour of a player is determined by its private information, or type. Based on this model, we derive a solution, called Harsanyi-Bellman Ad Hoc Coordination (HBA), which utilises the concept of Bayesian Nash equilibrium in a planning procedure to find optimal actions in the sense of Bellman optimal control. We evaluate HBA in a multiagent logistics domain called level-based foraging, showing that it achieves higher flexibility and efficiency than several alternative algorithms. We also report on a human-machine experiment at a public science exhibition in which the human participants played repeated Prisoner's Dilemma and Rock-Paper-Scissors against HBA and alternative algorithms, showing that HBA achieves equal efficiency and a significantly higher welfare and winning rate.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning
To achieve general intelligence, agents must learn how to interact with others in a shared environment: this is the challenge of multiagent reinforcement learning (MARL). The simplest form is independent reinforcement le…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Multiagent Soft Q-Learning
Policy gradient methods are often applied to reinforcement learning in continuous multiagent games. These methods perform local search in the joint-action space, and as we show, they are susceptable to a game-theoretic p…
Policy Gradient MethodsQ-Learningreinforcement-learningReinforcement Learning+1Combining Deep Reinforcement Learning and Search with Generative Models for Game-Theoretic Opponent Modeling
Opponent modeling methods typically involve two crucial steps: building a belief distribution over opponents' strategies, and exploiting this opponent model by playing a best response. However, existing approaches typica…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Coordinating Multiagent Industrial Symbiosis
We present a formal multiagent framework for coordinating a class of collaborative industrial practices called Industrial Symbiotic Networks (ISNs) as cooperative games. The game-theoretic formulation of ISNs enables sys…
SA-IGA: A Multiagent Reinforcement Learning Method Towards Socially Optimal Outcomes
In multiagent environments, the capability of learning is important for an agent to behave appropriately in face of unknown opponents and dynamic environment. From the system designer's perspective, it is desirable if th…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)