Audit scenario tree decision integrity

Audit whether an adaptive management or capital policy is executable rather than clairvoyant: reconcile terminal probability mass, tree depth and unique node ancestry; require identical actions and information releases for indistinguishable histories; reject actions whose declared evidence is revealed only later; and retain unverified scenario exposure.

What it's for

Lets a CEO, board or investor distinguish a genuinely adaptive plan from a spreadsheet that quietly chooses today using tomorrow's information.

What you give it

Inputs split into evidence read from your connected systems, calibration your team owns, and numerical controls that affect precision but never the result's meaning.

Field Type Role Required
max_detail_rows integer ≥ 1, ≤ 500 Numerical control Optional
minimum_terminal_scenarios_per_policy integer ≥ 2, ≤ 100000 Your calibration Optional
probability_tolerance number ≥ 0, ≤ 0.01 Your calibration Optional
scenario_paths array of objects (9 fields) ≥ 2 items Evidence Yes

Each scenario_paths record

Field Type Required
action_ids_by_stage array of string (≥ 2 items) Yes
action_information_dependencies_by_stage array of array (≥ 2 items) Yes
evidence_verified boolean Yes
id string (non-empty) Yes
node_path array of string (≥ 2 items) Yes
policy_id string (non-empty) Yes
probability number (> 0, ≤ 1) Yes
revealed_information_by_stage array of array (≥ 2 items) Yes
scenario_id string (non-empty) Yes
Example input
{
  "scenario_paths": [
    {
      "action_ids_by_stage": [
        "reserve-capacity",
        "slow-roadmap"
      ],
      "action_information_dependencies_by_stage": [
        [],
        [
          "demand"
        ]
      ],
      "evidence_verified": true,
      "id": "policy-low",
      "node_path": [
        "root",
        "low-demand"
      ],
      "policy_id": "adaptive-roadmap",
      "probability": 0.4,
      "revealed_information_by_stage": [
        [],
        [
          "demand"
        ]
      ],
      "scenario_id": "low-demand"
    },
    {
      "action_ids_by_stage": [
        "reserve-capacity",
        "scale-roadmap"
      ],
      "action_information_dependencies_by_stage": [
        [],
        [
          "demand"
        ]
      ],
      "evidence_verified": true,
      "id": "policy-high",
      "node_path": [
        "root",

Truncated for display — the full payload is 58 lines.

What you get back

This is the actual output of running the example above — computed by the same function the platform calls, not an illustration.

Example output
{
  "configuration": {
    "minimum_terminal_scenarios_per_policy": 2,
    "probability_tolerance": 0
  },
  "decision": "scenario_tree_decision_integrity_supported",
  "guardrails": [
    "A decision at a node may use only information released by that node and must be identical for every terminal scenario sharing that history. Scenario-specific actions before their distinguishing signal are clairvoyance, not management flexibility.",
    "Terminal probabilities, node identities, action provenance and information-release times must come from one frozen scenario-tree version. The audit does not certify the probabilities or economic assumptions themselves.",
    "Failures diagnose an aggregate planning artifact. They are not evidence of fraud, employee misconduct or intent, and must not be used for individual employment or security decisions."
  ],
  "method": "scenario_tree_probability_information_nonanticipativity_audit",
  "policy_diagnostics": [
    {
      "ambiguous_node_ids": [],
      "decision": "scenario_tree_policy_integrity_supported",
      "failed_checks": [],
      "future_information_dependencies": [],
      "inconsistent_information_nodes": [],
      "nonanticipativity_violation_nodes": [],
      "policy_id": "adaptive-roadmap",
      "probability_mass": 1,
      "stage_count": 2,
      "terminal_scenario_count": 2,
      "unverified_probability_mass": 0
    }
  ],
  "summary": {
    "action_required_policy_count": 0,
    "ambiguous_node_id_count": 0,
    "future_information_dependency_count": 0,
    "information_set_inconsistency_count": 0,
    "nonanticipativity_violation_node_count": 0,
    "policy_count": 1,
    "summed_unverified_probability_mass": 0,
    "supported_policy_count": 1
  },
  "truncation": {
    "policies_omitted": 0
  }
}

How it works

Constrained optimization — Pick the best feasible option under real limits — budget, headcount, dependencies, capacity — rather than ranking a list and hoping it fits.

  1. 1 Freeze each policy, terminal scenario, probability, ordered node history, action sequence, information-release sequence and declared action-information dependency from one immutable scenario-tree version.
  2. 2 Within each policy, reconcile probability mass, stage alignment, one root and unique node ancestry; then group terminal paths by every shared prefix and verify that both available information and chosen action are identical at the decision node.
  3. 3 Accumulate information only when released, flag dependencies on unavailable future signals, preserve unverified probability mass and withhold integrity whenever support, probability, ancestry, evidence, information timing or nonanticipativity fails.

Before you trust it

Every tool in the catalog ships with the conditions under which its answer is meaningful — and the conditions under which it should abstain instead of guessing.

Assumptions & guardrails

  • Objectives use commensurable locally governed value units, constraints reflect real feasibility, and uncertainty covers plausible adverse inputs.
  • Node paths encode exactly what was observable before each action; terminal scenarios are exhaustive and mutually exclusive within the governed perimeter; action IDs identify the complete executable decision, not a label hiding scenario-specific terms.
  • The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.
  • Passing proves structural executability only, not probability calibration, economic value or legal authority. Failures diagnose a planning artifact and are never evidence of individual misconduct, fraud or intent.

Minimum evidence

  • scenario_paths: at least 2 rows/items

How to validate it

Backtest the chosen action against simple feasible baselines on held-out scenarios, sweep costs/constraints/risk tolerance, and require constraint feasibility under adverse inputs.

Calibrating it to your org

Same for everyone

The mathematical kernel, validation rules, method version, and JSON output semantics are organization-independent; no tenant-trained coefficients or company benchmark is embedded in the function.

Specific to you

  • point-in-time scenario-tree export joining each policy action only to information legally observable before that decision, retaining terminal zero-value paths, superseded versions and explicit no-action nodes
  • decision perimeter, scenario exhaustiveness/mutual exclusivity, node and information-release semantics, action identity/completeness, evidence verification, minimum terminal support, probability tolerance and approval authority

Calibration workflow

  1. 1 Define the management decision, target outcome, aggregate unit, privacy boundary, cadence, and prediction/intervention horizon for this organization.
  2. 2 Build a tenant-scoped historical cohort using only information available before each prediction or decision; preserve zero periods, censoring, assignment probabilities, and unresolved outcomes when the method requires them.
  3. 3 Estimate statistical parameters on training history, but obtain costs, utilities, risk tolerance, practical-effect thresholds, capacity, and policy constraints from accountable decision owners.
  4. 4 Validate on later time windows or held-out aggregate units at the deployment grain, against a simple baseline and the function-specific validation strategy.
  5. 5 Deploy only if the returned decision clears evidence, overlap, calibration, robustness, and guardrail checks; warning, unsupported, schema-gap, and fallback decisions are abstentions.
  6. 6 Monitor realized outcomes, data drift, coverage, and decision regret; recalibrate at a governed cadence or after a detected regime/definition change, never merely because a stakeholder dislikes the result.

Call it from your AI

You don't wire up 388 tools in your MCP client. The GitRevio MCP server exposes 18 tools, three of which let an agent search the catalog, read a tool's schema, and run it — so the assistant finds this one on its own.

gitrevio_capabilities_search
  { "q": "audit whether an adaptive management or" }
  → finds "audit_scenario_tree_decision_integrity"

gitrevio_capability_describe
  { "capability_id": "audit_scenario_tree_decision_integrity" }
  → returns the input schema and agent guidance shown on this page

gitrevio_capability_run
  { "capability_id": "audit_scenario_tree_decision_integrity", "arguments": { ... } }
  → returns the result shown above

Works in Claude Desktop, Claude Code, Cursor, Cline, Continue.dev, Goose and Aider. See the MCP server.

Related tools

Calculate value of management flexibility

Price only executable management flexibility on one coherent scenario set: compare a frozen static plan, a nonanticipative adaptive policy and a perfect-information upper bound; separate expected flexibility from remaining information value, tail underperformance and tail regret; quantify liquidity-risk reduction; and refuse value when policy integrity, evidence or dominance fails.

Constrained optimization

Optimize time consistent capital policy

Optimize a finite multistage capital policy that can actually be followed: attach action bundles to observable scenario-tree nodes, enforce local budgets/capacity plus pathwise dependencies and exclusions, roll scenario cash and terminal enterprise value, constrain liquidity chance and recursively nested conditional CVaR, and disclose exact global enumeration or deterministic beam fallback.

Constrained optimization

Aggregate risk register copula

Aggregate risk-register occurrence and lognormal severity marginals through a validated Gaussian copula into expected loss, VaR, CVaR, dependence amplification, and tail shares.

Statistical audit & measurement

Allocate restless bandit interventions

Allocate scarce recurring interventions across evolving Markov units with Whittle indices, explicit indexability checks, and paired policy simulation.

Sequential Bayesian & bandits

Attribute commercial dependency tail loss

Calculate expected loss, VaR and CVaR for commercial value concentrated in shared technical components, then allocate every modeled tail-loss dollar exactly once across components with normalized negative-log survival hazard rather than overlapping leave-one-out sensitivities.

Forecasting & survival

Audit commercial resilience claim integrity

Audit resilience ROI claims against a unique commercial-source to technical-component graph: recompute each action's avoided loss under joint failure scenarios, cap support at graph-derived value, detect duplicate effects, probability drift and weak evidence, and prevent overlapping component benefits from being sold twice.

Network & dependency analysis

See every tool in Risk, tails & resilience →

Ready to See Your Engineering work clearly?

Request a free demo