Dynamic programming for partially observable stochastic games

DMCA

Dynamic programming for partially observable stochastic games (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Eric A. Hansen

Venue:	In Proceedings of the Nineteenth National Conference on Artificial Intelligence
Citations:	159 - 25 self

BibTeX

@INPROCEEDINGS{Hansen04dynamicprogramming,
    author = {Eric A. Hansen},
    title = {Dynamic programming for partially observable stochastic games},
    booktitle = {In Proceedings of the Nineteenth National Conference on Artificial Intelligence},
    year = {2004},
    pages = {709--715}
}

OpenURL

Abstract

We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable Markov decision processes (POMDPs) and iterated elimination of dominated strategies in normal form games. We prove that when applied to finite-horizon POSGs, the algorithm iteratively eliminates very weakly dominated strategies without first forming a normal form representation of the game. For the special case in which agents share the same payoffs, the algorithm can be used to find an optimal solution. We present preliminary empirical results and discuss ways to further exploit POMDP theory in solving POSGs. 1.

Keyphrases

dynamic programming observable stochastic game observable markov decision process normal form game optimal solution finite-horizon posgs iterated elimination present preliminary empirical result exact dynamic programming algorithm dominated strategy agent share normal form representation exploit pomdp theory special case discus way

DMCA