Abstract
In non-cooperative multiagent settings, methods for planning require modeling other agents’ possible behaviors. However, the space of these models - whether these are policy trees, finite-state controllers, or intentional models - is very large and thus arbitrarily bounded. This may exclude the true model or the optimal model. In this chapter, we present a novel iterative algorithm for online planning that considers a limited model space, updates it dynamically using data from interactions, and provides a provable and probabilistic bound on the approximation error. We ground this approach in the context of graphical models for planning in partially observable multiagent settings - interactive dynamic influence diagrams. We empirically demonstrate that the limited model space facilitates fast solutions and that the true model often enters the limited model space.
Original language | English |
---|---|
Title of host publication | Interactions In Multiagent Systems |
Publisher | World Scientific |
Pages | 229-264 |
Number of pages | 36 |
ISBN (Electronic) | 9789813208742 |
DOIs | |
Publication status | Published - 1 Jan 2018 |
Externally published | Yes |