nips nips2011 nips2011-256 nips2011-256-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Denis D. Maua, Cassio Campos
Abstract: We present a new algorithm for exactly solving decision-making problems represented as an influence diagram. We do not require the usual assumptions of no forgetting and regularity, which allows us to solve problems with limited information. The algorithm, which implements a sophisticated variable elimination procedure, is empirically shown to outperform a state-of-the-art algorithm in randomly generated problems of up to 150 variables and 1064 strategies. 1
[1] N. L. Zhang, R. Qi, and D. Poole. A computational theory of decision networks. International Journal of Approximate Reasoning, 11(2):83–158, 1994.
[2] S. L. Lauritzen and D. Nilsson. Representing and solving decision problems with limited information. Management Science, 47:1235–1251, 2001.
[3] P. Poupart and C. Boutilier. Bounded finite state controllers. In Advances in Neural Information Processing Systems 16 (NIPS), 2003.
[4] A. Detwarasiti and R. D. Shachter. Influence diagrams for team decision analysis. Decision Analysis, 2(4):207–228, 2005.
[5] C. Amato, D. S. Bernstein, and S. Zilberstein. Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs. Autonomous Agents and Multi-Agent Systems, 21(3):293–320, 2010.
[6] R. A. Howard and J. E. Matheson. Influence diagrams. In Readings on the Principles and Applications of Decision Analysis, pages 721–762. Strategic Decisions Group, 1984.
[7] J. A. Tatman and R. D. Shachter. Dynamic programming and influence diagrams. IEEE Transactions on Systems, Man and Cybernetics, 20(2):365–379, 1990.
[8] C. P. de Campos and Q. Ji. Strategy selection in influence diagrams using imprecise probabilities. In Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, pages 121–128, 2008.
[9] D. Koller and N. Friedman. Probabilistic Graphical Models - Principles and Techniques. MIT Press, 2009.
[10] G. F. Cooper. A method for using belief networks as influence diagrams. Fourth Workshop on Uncertainty in Artificial Intelligence, 1988.
[11] P. Shenoy and G. Shafer. Axioms for probability and belief-function propagation. In Proceedings of the Fourth Conference on Uncertainty in Artificial Intelligence, pages 169–198. Elsevier Science, 1988.
[12] J. Kohlas. Information Algebras: Generic Structures for Inference. Springer-Verlag, 2003.
[13] R. Haenni. Ordered valuation algebras: a generic framework for approximating inference. International Journal of Approximate Reasoning, 37(1):1–41, 2004.
[14] H. Fargier, E. Rollon, and N. Wilson. Enabling local computation for partially ordered preferences. Constraints, 15:516–539, 2010.
[15] Ilog Optimization. CPLEX documentation. http://www.ilog.com, 1990. 9