Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes with a price, namely a high computational cost. Solving POSGs optimally quickly becomes intractable after a few decision cyc...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2214 https://ink.library.smu.edu.sg/context/sis_research/article/3214/viewcontent/KZflairs09.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
History-Based Controller Design and Optimization for Partially Observable MDPs
by: KUMAR, Akshat, et al.
Published: (2015) -
Constraint-Based Dynamic Programming for Decentralized POMDPs with Structured Interactions
by: KUMAR, Akshat, et al.
Published: (2009) -
Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
by: KUMAR, Akshat, et al.
Published: (2011) -
Message Passing Algorithms for MAP Estimation using DC Programming
by: KUMAR, Akshat, et al.
Published: (2012) -
Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximation
by: KUMAR, Akshat, et al.
Published: (2009)