Abstract
We consider the situation where two agents try to solve each their own task in a common
environment. We present a general framework for representing that kind of scenario
based on Influence Diagrams (IDs). The framework is used to model the analysis depth
and time horizon of the opponent agent and to determine an optimal policy under various
assumptions on analysis depth of the opponent. Not surprisingly, the framework turns
out to have severe complexity problems even in simple scenarios due to the size of the
relevant past. We propose an algorithm based on Limited Memory Influence Diagrams
(LIMIDs) in which we convert the ID into a Bayesian network and perform single policy
update. Empirical results are presented using a simple board game.
Original language | English |
---|---|
Title of host publication | Proceedings of the 4th European Workshop on Probabilistic Graphical Models |
Editors | Manfred Jaeger, Thomas D. Nielsen |
Publication date | 2008 |
Publication status | Published - 2008 |
Event | European Workshop on Probabilistic Graphical Models (PGM) - Hirtshals, Denmark Duration: 17 Sept 2008 → 19 Sept 2008 Conference number: 4 |
Conference
Conference | European Workshop on Probabilistic Graphical Models (PGM) |
---|---|
Number | 4 |
Country/Territory | Denmark |
City | Hirtshals |
Period | 17/09/2008 → 19/09/2008 |