A computational theory of decision networks
From MaRDI portal
Publication:1344262
DOI10.1016/0888-613X(94)90026-4zbMath0816.90005MaRDI 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
62C10: Bayesian problems; characterization of Bayes procedures
91B06: Decision theory
90C40: Markov and semi-Markov decision processes
Related Items
Decomposition of influence diagrams, A framework and a mean-field algorithm for the local control of spatial processes, 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, Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks, A computational theory of decision networks, The independent choice logic for modelling multiple agents under uncertainty, Multi-agent influence diagrams for representing and solving games., Inference procedures and engine for probabilistic argumentation, Decision programming for mixed-integer multi-stage optimization under uncertainty, Computer science and decision theory, Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item