Decentralized control of partially observable Markov decision processes

C Amato, G Chowdhary, A Geramifard… - … IEEE Conference on …, 2013 - ieeexplore.ieee.org
Markov decision processes (MDPs) are often used to model sequential decision problems
involving uncertainty under the assumption of centralized control. However, many large …

[KÖNYV][B] A concise introduction to decentralized POMDPs

FA Oliehoek, C Amato - 2016 - Springer
This book presents an overview of formal decision making methods for decentralized
cooperative systems. It is aimed at graduate students and researchers in the fields of …

Optimal and approximate Q-value functions for decentralized POMDPs

FA Oliehoek, MTJ Spaan, N Vlassis - Journal of Artificial Intelligence …, 2008 - jair.org
Decision-theoretic planning is a popular approach to sequential decision making problems,
because it treats uncertainty in sensing and acting in a principled way. In single-agent …

Randomized entity-wise factorization for multi-agent reinforcement learning

S Iqbal, CAS De Witt, B Peng… - International …, 2021 - proceedings.mlr.press
Multi-agent settings in the real world often involve tasks with varying types and quantities of
agents and non-agent entities; however, common patterns of behavior often emerge among …

Rethinking formal models of partially observable multiagent decision making

V Kovařík, M Schmid, N Burch, M Bowling, V Lisý - Artificial Intelligence, 2022 - Elsevier
Multiagent decision-making in partially observable environments is usually modelled as
either an extensive-form game (EFG) in game theory or a partially observable stochastic …

Improving policies via search in cooperative partially observable games

A Lerer, H Hu, J Foerster, N Brown - … of the AAAI conference on artificial …, 2020 - ojs.aaai.org
Recent superhuman results in games have largely been achieved in a variety of zero-sum
settings, such as Go and Poker, in which agents need to compete against others. However …

Decentralized pomdps

FA Oliehoek - Reinforcement learning: state-of-the-art, 2012 - Springer
This chapter presents an overview of the decentralized POMDP (Dec-POMDP) framework. In
a Dec-POMDP, a team of agents collaborates to maximize a global reward based on local …

Scalable planning and learning for multiagent POMDPs

C Amato, F Oliehoek - Proceedings of the AAAI Conference on Artificial …, 2015 - ojs.aaai.org
Online, sample-based planning algorithms for POMDPs have shown great promise in
scaling to problems with large state spaces, but they become intractable for large action and …

Online planning for multi-agent systems with bounded communication

F Wu, S Zilberstein, X Chen - Artificial Intelligence, 2011 - Elsevier
We propose an online algorithm for planning under uncertainty in multi-agent settings
modeled as DEC-POMDPs. The algorithm helps overcome the high computational …

Distributed problem solving

W Yeoh, M Yokoo - AI Magazine, 2012 - ojs.aaai.org
Distributed problem solving is a subfield within multiagent systems, where agents are
assumed to be part of a team and collaborate with each other to reach a common goal. In …