Solving Limited Memory Influence Diagrams

DOI10.1613/jair.3625zbMath1280.68100arXiv1109.1754OpenAlexW2146883452MaRDI QIDQ2905380

Marco Zaffalon, Cassio Polpo de Campos, Denis Deratani Mauá

Publication date: 27 August 2012

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1754

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ Fast local search methods for solving limited memory influence diagrams ⋮ Unnamed Item ⋮ On Imperfect Recall in Multi-Agent Influence Diagrams ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables ⋮ Strategy Graphs for Influence Diagrams

This page was built for publication: Solving Limited Memory Influence Diagrams