An Influence Diagram framework for acting under influence by agents with unknown goals

Nicolaj Sønderberg-Madsen; Finn V. Jensen

An Influence Diagram framework for acting under influence by agents with unknown goals

Nicolaj Sønderberg-Madsen, Finn V. Jensen

Institut for Datalogi

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

2 Citationer (Scopus)

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.

Originalsprog	Engelsk
Titel	Proceedings of the 4th European Workshop on Probabilistic Graphical Models
Redaktører	Manfred Jaeger, Thomas D. Nielsen
Publikationsdato	2008
Status	Udgivet - 2008
Begivenhed	European Workshop on Probabilistic Graphical Models (PGM) - Hirtshals, Danmark Varighed: 17 sep. 2008 → 19 sep. 2008 Konferencens nummer: 4

Konference

Konference	European Workshop on Probabilistic Graphical Models (PGM)
Nummer	4
Land/Område	Danmark
By	Hirtshals
Periode	17/09/2008 → 19/09/2008

Adgang til dokumentet

http://pgm08.cs.aau.dk/online_proc.html

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@inproceedings{c434c5508a3711dd8827000ea68e967b,

title = "An Influence Diagram framework for acting under influence by agents with unknown goals",

abstract = "We consider the situation where two agents try to solve each their own task in a commonenvironment. We present a general framework for representing that kind of scenariobased on Influence Diagrams (IDs). The framework is used to model the analysis depthand time horizon of the opponent agent and to determine an optimal policy under variousassumptions on analysis depth of the opponent. Not surprisingly, the framework turnsout to have severe complexity problems even in simple scenarios due to the size of therelevant 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 policyupdate. Empirical results are presented using a simple board game.",

author = "Nicolaj S{\o}nderberg-Madsen and Jensen, {Finn V.}",

year = "2008",

language = "English",

editor = "Manfred Jaeger and Nielsen, {Thomas D.}",

booktitle = "Proceedings of the 4th European Workshop on Probabilistic Graphical Models",

note = "European Workshop on Probabilistic Graphical Models (PGM) ; Conference date: 17-09-2008 Through 19-09-2008",

}

An Influence Diagram framework for acting under influence by agents with unknown goals. / Sønderberg-Madsen, Nicolaj; Jensen, Finn V.
Proceedings of the 4th European Workshop on Probabilistic Graphical Models. red. / Manfred Jaeger; Thomas D. Nielsen. 2008.

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

TY - GEN

T1 - An Influence Diagram framework for acting under influence by agents with unknown goals

AU - Sønderberg-Madsen, Nicolaj

AU - Jensen, Finn V.

N1 - Conference code: 4

PY - 2008

Y1 - 2008

N2 - We consider the situation where two agents try to solve each their own task in a commonenvironment. We present a general framework for representing that kind of scenariobased on Influence Diagrams (IDs). The framework is used to model the analysis depthand time horizon of the opponent agent and to determine an optimal policy under variousassumptions on analysis depth of the opponent. Not surprisingly, the framework turnsout to have severe complexity problems even in simple scenarios due to the size of therelevant 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 policyupdate. Empirical results are presented using a simple board game.

AB - We consider the situation where two agents try to solve each their own task in a commonenvironment. We present a general framework for representing that kind of scenariobased on Influence Diagrams (IDs). The framework is used to model the analysis depthand time horizon of the opponent agent and to determine an optimal policy under variousassumptions on analysis depth of the opponent. Not surprisingly, the framework turnsout to have severe complexity problems even in simple scenarios due to the size of therelevant 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 policyupdate. Empirical results are presented using a simple board game.

M3 - Article in proceeding

BT - Proceedings of the 4th European Workshop on Probabilistic Graphical Models

A2 - Jaeger, Manfred

A2 - Nielsen, Thomas D.

T2 - European Workshop on Probabilistic Graphical Models (PGM)

Y2 - 17 September 2008 through 19 September 2008

ER -

An Influence Diagram framework for acting under influence by agents with unknown goals

Abstract

Konference

Adgang til dokumentet

AUB Link

Fingeraftryk

Citationsformater