Stochastic planning for weakly-coupled distributed agents
AAMAS '06: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, page 326--328. New York, NY, USA, ACM Press, (2006)DOI: http://doi.acm.org/10.1145/1160633.1160689
Abstract
Partially observable stochastic games (POSGs) provide a powerful framework for modeling multi-agent interactions. While elegant and expressive, this framework has been shown to be computationally intractable 1. An exact dynamic programming algorithm for POSGs has been developed recently, but due to high computational demands, it has only been demonstrated to work on extremely small problems. Several approximate approaches have been developed 3, 5, but they lack strong theoretical guarantees. In light of these theoretical and practical limitations, there is a need to identify special classes of POSGs that can be solved tractably.
Description
: AAMAS '06, Stochastic planning for weakly-coupled ...
