The Curious Case of Exploding DecPOMDPs: Containing the Fire through Policy Counting
TL;DR
This paper redirects the focus from counting agents to counting policies, which actually enables tractability in agent numbers for so called policy-counted DecPOMDPs, and presents policy-counted dynamic programming using the compact representation to solve policy-counted DecPOMDPs efficiently.
Abstract
Decentralised partially observable Markov decision processes (DecPOMDPs) provide a general framework for modelling multi-agent decision making under uncertainty. However, DecPOMDPs are known to suffer from exponential complexity in the number of agents. One way to combat this intractability in agent numbers is to look at partitions of agents that exhibit a form of symmetry among agents, allowing for a compact encoding by counting. However, a challenge arises as the policy space explodes, even though the model complexity and evaluation cost reduce to a polynomial dependence. In this paper, we redirect our focus from counting agents to counting policies, which actually enables tractability in agent numbers for so called policy-counted DecPOMDPs. Further, we present policy-counted dynamic programming using the compact representation to solve policy-counted DecPOMDPs efficiently.
