Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

91

Voted

KI
2006
Springer

136views Artificial Intelligence» more KI 2006»

Game-Theoretic Agent Programming in Golog Under Partial Observability

15 years 2 months ago

Game-Theoretic Agent Programming in Golog Under Partial Observability

Download www.kr.tuwien.ac.at

Alberto Finzi, Thomas Lukasiewicz

Real-time Traffic

Artificial Intelligence | KI 2006 |

claim paper

Related Content

» Game theoretic Golog under partial observability

» Team Programming in Golog under Partial Observability

» Dynamic Programming Approximations for Partially Observable Stochastic Games

» Computing Optimal Policies for Partially Observable Decision Processes Using Compact Repre...

» Not all agents are equal scaling up distributed POMDPs for agent networks

» Stackelberg vs Nash in security games interchangeability equivalence and uniqueness

» Compact Convex Upper Bound Iteration for Approximate POMDP Planning

» Pointbased incremental pruning heuristic for solving finitehorizon DECPOMDPs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	KI
Authors	Alberto Finzi, Thomas Lukasiewicz

Comments (0)