. S. Bernstein-d, . Givan-r, . Immerman-n, and . Zilberstein-s, The Complexity of Decentralized Control of Markov Decision Processes, The Complexity of Decentralized Control of Markov Decision Processes, pp.819-840, 2002.
DOI : 10.1287/moor.27.4.819.297

. S. Lovejoy-w, Computationally Feasible Bounds for Partially Observed Markov Decision Processes, Operations Research, vol.39, issue.1, pp.162-175, 1991.
DOI : 10.1287/opre.39.1.162

. Nair-r, Y. M. Tambe-m, P. D. , and M. S. , Taming Decentralized POMDPs : Towards Efficient Policy Computation for Multiagent Settings, Proceedings of the 18th International Joint Conference on Artificial Intelligence, 2003.

J. Pineau and G. G. Thrun-s, « Point-based value iteration : An anytime algorithm for POMDPs, Proceedings of the 18th International Joint Conference on Artificial Intelligence, 2003.

C. D. Szer, An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs, Proceedings of the 16th European Conference on Machine Learning, 2005.
DOI : 10.1007/11564096_38
URL : https://hal.archives-ouvertes.fr/inria-00000205

C. D. Szer and . Zilberstein-s, A Heuristic Search Algorithm for Solving Decentralized POMDPs, Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000204