A computational theory of decision networks
From MaRDI portal
Publication:1344262
DOI10.1016/0888-613X(94)90026-4zbMath0816.90005OpenAlexW1970673089MaRDI QIDQ1344262
Publication date: 13 July 1995
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0888-613x(94)90026-4
Bayesian problems; characterization of Bayes procedures (62C10) Decision theory (91B06) Markov and semi-Markov decision processes (90C40)
Related Items (12)
A computational theory of decision networks ⋮ Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities ⋮ Inference procedures and engine for probabilistic argumentation ⋮ The independent choice logic for modelling multiple agents under uncertainty ⋮ 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 ⋮ A framework and a mean-field algorithm for the local control of spatial processes ⋮ Multi-agent influence diagrams for representing and solving games. ⋮ Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks ⋮ Computer science and decision theory ⋮ Decomposition of influence diagrams ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended monotropic programming and duality
- Influence diagrams for statistical modelling
- Potential influence diagrams
- A computational theory of decision networks
- Probabilistic Inference and Influence Diagrams
- Valuation-Based Systems for Bayesian Decision Analysis
- Independence properties of directed markov fields
- An ordered examination of influence diagrams
- Contraction Mappings in the Theory Underlying Dynamic Programming
- An algebra of bayesian belief universes for knowledge‐based systems
This page was built for publication: A computational theory of decision networks