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.

What it's for

Turns a board scenario tree into an executable capital playbook—what to commit now and what to do later—without hindsight leakage or risk-policy reversals.

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
actions array of objects (9 fields) Evidence Yes
beam_width integer ≥ 2, ≤ 10000 Numerical control Optional
budget_by_node object Evidence Yes
capacity_by_node object Evidence Yes
max_detail_rows integer ≥ 1, ≤ 500 Numerical control Optional
maximum_exact_policies integer ≥ 2, ≤ 10000000 Your calibration Optional
maximum_liquidity_breach_probability number ≥ 0, ≤ 1 Your calibration Optional
maximum_nested_cvar_loss number ≥ 0 Your calibration Optional
minimum_cash_buffer number Your calibration Optional
risk_aversion number ≥ 0 Your calibration Optional
scenarios array of objects (5 fields) ≥ 2 items Evidence Yes
starting_cash number Your calibration Yes
tail_probability number > 0, ≤ 0.5 Your calibration Optional
terminal_value_floor number Your calibration Optional

Each actions record

Field Type Required
budget_cost number (≥ 0) Yes
capacity_units number (≥ 0) Yes
cash_effect_scenarios array of number (≥ 2 items) Yes
dependency_ids array of string Yes
eligible_node_ids array of string (≥ 1 item) Yes
exclusion_ids array of string Yes
id string (non-empty) Yes
terminal_value_effect_scenarios array of number (≥ 2 items) Yes
transaction_cost_scenarios array of number (≥ 2 items) Yes
Example input
{
  "actions": [
    {
      "budget_cost": 1,
      "capacity_units": 1,
      "cash_effect_scenarios": [
        40,
        0
      ],
      "dependency_ids": [],
      "eligible_node_ids": [
        "adverse"
      ],
      "exclusion_ids": [],
      "id": "adverse-bridge",
      "terminal_value_effect_scenarios": [
        -10,
        0
      ],
      "transaction_cost_scenarios": [
        2,
        0
      ]
    }
  ],
  "budget_by_node": {
    "adverse": 1,
    "favorable": 0,
    "root": 0
  },
  "capacity_by_node": {
    "adverse": 1,
    "favorable": 0,
    "root": 0
  },
  "maximum_liquidity_breach_probability": 0,
  "maximum_nested_cvar_loss": 0,
  "minimum_cash_buffer": 20,
  "scenarios": [
    {
      "base_cash_flows": [
        0,
        -60
      ],

Truncated for display — the full payload is 69 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": {
    "action_count": 1,
    "maximum_liquidity_breach_probability": 0,
    "maximum_nested_cvar_loss": 0,
    "minimum_cash_buffer": 20,
    "risk_aversion": 0,
    "scenario_count": 2,
    "stage_count": 2,
    "starting_cash": 50,
    "tail_probability": 0.4,
    "terminal_value_floor": 0
  },
  "decision": "time_consistent_capital_policy_supported",
  "guardrails": [
    "Every selected action is attached to an observable scenario-tree node and therefore shared by all descendant scenarios. The optimizer never chooses a different action for futures that are indistinguishable at decision time.",
    "Nested conditional CVaR is recomputed from terminal loss through every information stage, avoiding the time inconsistency of optimizing one static terminal tail measure and later reversing the policy. Probabilities, cash effects, value effects and transaction costs still require local prospective calibration.",
    "Exact enumeration certifies only the declared finite action/tree model. Beam search explicitly withholds global optimality; neither mode establishes legal financing availability, causal effects, solvency or permission to execute without accountable finance and technology owners."
  ],
  "method": "nonanticipative_multistage_capital_policy_with_nested_cvar",
  "scenario_diagnostics": [
    {
      "liquidity_breach": false,
      "loss": 0,
      "minimum_cash": 28,
      "node_path": [
        "root",
        "adverse"
      ],
      "probability": 0.4,
      "scenario_id": "adverse",
      "selected_action_ids": [
        "adverse-bridge"
      ],
      "terminal_value": 38
    },
    {
      "liquidity_breach": false,
      "loss": 0,
      "minimum_cash": 50,
      "node_path": [
        "root",
        "favorable"
      ],

Truncated for display — the full payload is 79 lines.

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 one rooted terminal scenario tree with joint probabilities, ordered node paths, base cash flows and terminal values; align every candidate action's cash, value and transaction-cost effects to that common scenario order.
  2. 2 Generate budget/capacity-feasible action bundles at each observable node, enforce same-node and ancestor dependencies plus pathwise exclusions, and evaluate each policy by applying one shared node decision to all descendant futures.
  3. 3 Roll cash pathwise, calculate terminal net value and monetary shortfall, recursively compose conditional tail-CVaR from leaves to root, enforce liquidity chance and nested-risk gates, then maximize expected terminal value less governed risk aversion using exact enumeration or a deterministic disclosed beam.

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 identity and information timing are immutable; scenario effects are jointly calibrated rather than independently sorted; actions are legally and operationally available at every eligible node; one-time transaction costs and cash/value effects are complete and not duplicated.
  • The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.
  • Exactness applies only to the declared finite model. Beam output is not globally certified; neither solver mode proves causal action effects, solvency, legal availability or permission to execute. Re-optimize only at governed nodes after the encoded information is observed.

Minimum evidence

  • starting_cash: required and organization-defined
  • scenarios: at least 2 rows/items
  • actions: required and organization-defined
  • budget_by_node: required and organization-defined
  • capacity_by_node: required and organization-defined

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

  • version-matched executable action registry joined to a finance-approved multistage scenario tree, with prospective common-scenario effects and unique observable decision nodes
  • tree topology, probabilities and information timing; starting cash, cash-flow/value/cost basis; action legal/operational availability and causal evidence; node budgets/capacity, relations, liquidity/value floors, chance/CVaR/risk-aversion gates, solver boundary and activation 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": "optimize a finite multistage capital policy" }
  → finds "optimize_time_consistent_capital_policy"

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

gitrevio_capability_run
  { "capability_id": "optimize_time_consistent_capital_policy", "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

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.

Constrained optimization

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

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