Research map / Learning theory and algorithms / Prediction and decision losses
A Complete Criterion for Value of Information in Soluble Influence Diagrams
Chris van Merwijk, Ryan Carey, Tom Everitt
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the minimal d-reduction criterion: an information link is retained after iterative removal of nonrequisite links | Value-of-information analysis in soluble influence diagrams with multiple decisions · Soluble influence diagrams | criterion completeness | Improved |
| Use ID homomorphisms and trees of systems to construct a parameterization for the completeness proof | Value-of-information criterion in soluble multi-decision influence diagrams · Soluble influence diagrams | proof of completeness | Improved |
Closest papers by meaning
- Submodel Decomposition Bounds for Influence Diagrams (AAAI 2021 · similarity 0.85)
- Detecting Influence Structures in Multi-Agent Reinforcement Learning (ICML 2024 · similarity 0.80)
- Mecha-nudges for Machines (NeurIPS 2026 · similarity 0.79)
- On the Role of Information Structure in Reinforcement Learning for Partially-Observable Sequential Teams and Games (NeurIPS 2024 · similarity 0.78)
- Select to Perfect: Imitating desired behavior from large multi-agent data (ICLR 2024 · similarity 0.78)
- Measuring Error Alignment for Decision-Making Systems (AAAI 2025 · similarity 0.78)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
