%0 Conference Paper %1 Hansen2004 %A Hansen, Eric A. %A Bernstein, Daniel S. %A Zilberstein, Shlomo %B National Conference on Artificial Intelligence %C San Jose, California %D 2004 %K bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, exact, finite-horizon, lim-com, nondet-outcomes, partial-obs %P 709--715 %T Dynamic Programming for Partially Observable Stochastic Games %U http://rbr.cs.umass.edu/shlomo/papers/HBZaaai04.pdf

@inproceedings{Hansen2004, added-at = {2020-05-24T20:36:48.000+0200}, address = {San Jose, California}, author = {Hansen, Eric A. and Bernstein, Daniel S. and Zilberstein, Shlomo}, biburl = {https://www.bibsonomy.org/bibtex/2f8c885bfa0b5ca6afafb63d1a4dfbf06/marcondg}, booktitle = {National Conference on Artificial Intelligence}, comment = {Optimal. Early DP. Huge memory requirements. ---=note-separator=--- Optimal. Early DP. Huge memory requirements.}, interhash = {28711528b370487adb1715e71f83a08b}, intrahash = {f8c885bfa0b5ca6afafb63d1a4dfbf06}, keywords = {bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, exact, finite-horizon, lim-com, nondet-outcomes, partial-obs}, pages = {709--715}, timestamp = {2020-05-24T20:36:48.000+0200}, title = {{Dynamic Programming for Partially Observable Stochastic Games}}, url = {http://rbr.cs.umass.edu/shlomo/papers/HBZaaai04.pdf}, year = 2004 }