On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

DOI10.1016/J.ARTINT.2013.10.002zbMATH Open1334.68202DBLPjournals/ai/MauaCZ13OpenAlexW1991902833WikidataQ62046532 ScholiaQ62046532MaRDI QIDQ490443FDOQ490443

Authors D. D. Maua, C. P. De Campos, M. Zaffalon 

Publication date 27 August 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2013.10.002

zbMATH Keywords

computational complexitydecision theoryinfluence diagramsprobabilistic planningdecision networks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Solving limited memory influence diagrams
• Fast local search methods for solving limited memory influence diagrams
• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
• Representing and solving decision problems with limited information
• Complexity results and algorithms for possibilistic influence diagrams

Cites Work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• A note about redundancy in influence diagrams
• Bayesian Networks and Decision Graphs
• Credal networks
• Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
• Dynamic programming and influence diagrams
• Influence diagrams with memory states: representation and algorithms
• Representing and solving decision problems with limited information
• Solving limited memory influence diagrams

Cited In (6)

• Robustifying sum-product networks
• Solving limited memory influence diagrams
• 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
• Representing and solving decision problems with limited information
• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams

This page was built for publication: On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490443)