The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Dynamic programming and influence diagrams
Abstract
The concept of a super value node is developed to extend the theory of influence diagrams to allow dynamic programming to be performed within this graphical modeling framework. The operations necessary to exploit the presence of these nodes and efficiently analyze the models are developed. The key result is that by representing value function separability in the structure of the graph of the influence diagram, formulation is simplified and operations on the model can take advantage of the separability. From the decision analysis perspective, this allows simple exploitation of separability in the value function of a decision problem. This allows algorithms to be designed to solve influence diagrams that automatically recognize the opportunity for applying dynamic programming. From the decision processes perspective, influence diagrams with super value nodes allow efficient formulation and solution of nonstandard decision process structures. They also allow the exploitation of conditional independence between state variables.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Fusion, propagation, and structuring in belief networks
Pearl, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90072-x · Cited by 2,127
Shachter, R. D. (1986) · Operations Research · doi:10.1287/opre.34.6.871 · Cited by 1,250
Self-citationDynamic Programming and Stochastic Control
Bertsekas, D. P., & White, C. C. (1977) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1977.4309612 · Cited by 1,199
Uncertainty in Artificial Intelligence
Kanal, L. N., Lemmer, J. F., & Sage, A. P. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.4309045 · Cited by 938
Dynamic Programming and Markov Processes.
Kaufman, H., & Howard, R. A. (1961) · The American Mathematical Monthly · doi:10.2307/2312519 · Cited by 638
Probabilistic Inference and Influence Diagrams
Shachter, R. D. (1988) · Operations Research · doi:10.1287/opre.36.4.589 · Cited by 494
Self-citationBingham, N. H., & Billingsley, P. (1980) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982142 · Cited by 455
Development of Automated Aids for Decision Analysis
Miller, A. C., Merkhofer, I. I. I., Howard Miley, W., Matheson Ronald, A., Rice James, E., & Thomas, R. (1976) · Defense Technical Information Center (DTIC) · doi:10.21236/ada026379 · Cited by 74
Cited by
Bayesian Networks and Decision Graphs
Jensen, F. V., & Nielsen, T. D. (2007) · Information Science and Statistics · doi:10.1007/978-0-387-68282-2 · Cited by 4,129
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Bucket elimination: A unifying framework for reasoning
Dechter, R. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00059-4 · Cited by 583
Value-Function Approximations for Partially Observable Markov Decision Processes
Hauskrecht, M. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.678 · Cited by 527
Bucket Elimination: A Unifying Framework for Probabilistic Inference
Dechter, R. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_4 · Cited by 452
Metadata
- Authors
- Tatman, J. A., & Shachter, R. D.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1990
- Volume
- 20
- Issue
- 2
- Pages
- 365-379
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2094358804
- Cited by
- 266
- References
- 9
- FWCI
- 4.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic programming and influence diagrams. https://app.cochat.ai/papers/10.1109/21.52548
- The paper
- Tatman, J. A., & Shachter, R. D. (1990). Dynamic programming and influence diagrams. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/21.52548
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.