Complexity results and algorithms for possibilistic influence diagrams

DOI10.1016/J.ARTINT.2007.11.008MaRDI QIDQ2389644zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Laurent Garcia, Régis Sabbadin

Publication date 17 July 2009

Published in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

decision theoryinfluence diagramspossibility theorycausal networks

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Decision theory (91B06) Graphical methods in statistics (62A09) Statistical decision theory (62C99)

Recommendations

• Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities
• Possibilistic sequential decision making
• New graphical model for computing optimistic decisions in possibility theory framework
• Potential influence diagrams
• An axiomatic framework for influence diagram computation with partially ordered preferences

Cites work

• scientific article; zbMATH DE number 1634667 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• scientific article; zbMATH DE number 1340008 (Why is no real title available?)
• scientific article; zbMATH DE number 1548181 (Why is no real title available?)
• scientific article; zbMATH DE number 3288322 (Why is no real title available?)
• An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
• Consistency in networks of relations
• Decision-theoretic foundations of qualitative possibility theory
• Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
• On the transformation between possibilistic logic bases and possibilistic causal networks
• Optimal control of diffusion processes with reflection
• Qualitative decision theory with preference relations and comparative uncertainty: an axiomatic approach
• Stochastic dynamic programming with factored representations
• Towards qualitative approaches to multi-stage decision making

Cited in

(11)

• Evaluating interval-valued influence diagrams
• Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
• Efficient non-myopic value-of-information computation for influence diagrams
• An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
• New graphical model for computing optimistic decisions in possibility theory framework
• An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
• Planning in artificial intelligence
• Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities
• On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
• Computing rank dependent utility in graphical models for sequential decision problems
• An axiomatic framework for influence diagram computation with partially ordered preferences

This page was built for publication: Complexity results and algorithms for possibilistic influence diagrams

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