Co-occurring keywords · papers mentioning both
decentralized partially observable markov decision process
(5)
multi-agent system
(3)
multi-agent planning
(3)
heuristic search
(2)
computational complexity
(2)
multi-agent reinforcement learning
(2)
baseline regret minimization
(1)
belief generation
(1)
optimal planning
(1)
quantified boolean formula
(1)
Papers
Approximate Dec-POMDP Solving Using Multi-Agent A*
IJCAI 2024
Common Information based Approximate State Representations in Multi-Agent Reinforcement Learning
AISTATS 2022
Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty
AAAI 2021
Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing
ICML 2020
Macro-Action-Based Deep Multi-Agent Reinforcement Learning
CoRL 2019
Multi-Agent Planning with Baseline Regret Minimization
IJCAI 2017
Policy Gradient With Value Function Approximation For Collective Multiagent Planning
NeurIPS 2017
Point Based Value Iteration with Optimal Belief Compression for Dec-POMDPs
NeurIPS 2013
Competition Adds Complexity
NeurIPS 2007