Optimize attention aware alerting portfolio

Choose one governed alert policy per risk class with Erlang-C response queues and Monte Carlo risk, maximizing protected value net of missed/common loss, false-alert interruption, operating cost and CVaR under hard evidence, quality, response, budget, relation and capacity constraints.

What it's for

Turns cooldown, deduplication and severity routing into an explicit attention-capacity frontier so Gitrevio can add useful alerts without silently overwhelming the people expected to act.

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
alert_policy_options array of objects (17 fields) Evidence Yes
alert_risk_classes array of objects (14 fields) Evidence Yes
beam_width integer ≥ 1, ≤ 100000 Numerical control Optional
exact_state_limit integer ≥ 1, ≤ 10000000 Your calibration Optional
implementation_budget number ≥ 0 Your calibration Yes
max_detail_rows integer ≥ 1, ≤ 500 Numerical control Optional
random_seed integer ≥ 0, ≤ 4294967295 Your calibration Optional
resource_capacities array of objects (3 fields) ≥ 0 items Evidence Yes
response_queues array of objects (6 fields) Evidence Yes
risk_aversion number ≥ 0 Your calibration Optional
scenarios array of objects (9 fields) Evidence Yes
shared_incident_groups array of objects (3 fields) Evidence Yes
simulation_count integer ≥ 1000, ≤ 200000 Your calibration Optional
tail_probability number > 0, < 1 Your calibration Optional

Each alert_policy_options record

Field Type Required
alert_risk_class_id string (non-empty) Yes
available_scenario_ids array of string Yes
common_loss_reduction number (≥ 0, ≤ 1) Yes
dependency_option_ids array of string Yes
duplicate_alert_multiplier_scenarios array of number (≥ 1 item) Yes
evidence_verified boolean Yes
exclusion_option_ids array of string Yes
false_alert_interruption_cost number (≥ 0) Yes
false_positive_probability_scenarios array of number (≥ 1 item) Yes
id string (non-empty) Yes
implementation_cost number (≥ 0) Yes
is_current_state boolean Yes
operating_cost_scenarios array of number (≥ 1 item) Yes
resource_demand object Yes
satisfied_control_ids array of string Yes
sensitivity_scenarios array of number (≥ 1 item) Yes
severity_id string (non-empty) Yes
Example input
{
  "alert_policy_options": [
    {
      "alert_risk_class_id": "delivery-risk",
      "available_scenario_ids": [
        "base",
        "stress"
      ],
      "common_loss_reduction": 0,
      "dependency_option_ids": [],
      "duplicate_alert_multiplier_scenarios": [
        1.2,
        1.4
      ],
      "evidence_verified": true,
      "exclusion_option_ids": [],
      "false_alert_interruption_cost": 100,
      "false_positive_probability_scenarios": [
        0.15,
        0.2
      ],
      "id": "current",
      "implementation_cost": 0,
      "is_current_state": true,
      "operating_cost_scenarios": [
        500,
        600
      ],
      "resource_demand": {
        "engineering": 0
      },
      "satisfied_control_ids": [
        "tenant-scope"
      ],
      "sensitivity_scenarios": [
        0.75,
        0.7
      ],
      "severity_id": "p2"
    },
    {
      "alert_risk_class_id": "delivery-risk",
      "available_scenario_ids": [
        "base",

Truncated for display — the full payload is 166 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
{
  "baseline_current_state": {
    "class_metrics": [
      {
        "alert_risk_class_id": "delivery-risk",
        "expected_false_alert_cost": 52.82,
        "expected_missed_conditions": 0.173,
        "maximum_queue_wait_minutes": 5.4411,
        "option_id": "current"
      }
    ],
    "conditional_value_at_risk": 102131.6,
    "expected_false_alert_cost": 52.82,
    "expected_loss": 7430,
    "expected_operating_cost": 519.8,
    "expected_protected_value": 4089,
    "implementation_cost": 0,
    "option_ids": [
      "current"
    ],
    "queue_metrics": {
      "engineering-leads": {
        "maximum_utilization": 0.45,
        "maximum_wait_minutes": 5.4411
      }
    },
    "resource_use": {
      "engineering": 0
    },
    "risk_adjusted_score": -29446.52,
    "value_at_risk": 50140
  },
  "constraints": {
    "implementation_budget": 10000,
    "resource_capacities": {
      "engineering": 2
    },
    "risk_aversion": 0.25
  },
  "decision": "optimize",
  "failed_gates": [],
  "guardrails": [
    "Queueing capacity, service rates, policy effects, costs and loss are organization-owned inputs that require prospective validation; vendor defaults and generic benchmarks are not evidence.",
    "The optimizer selects only among supplied aggregate alert policies and never sends, suppresses or escalates an alert automatically.",

Truncated for display — the full payload is 110 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 aggregate risk classes, material-condition Beta priors, coherent opportunity/value/loss scenarios, response queues and independently tested candidate alert policies.
  2. 2 For each portfolio, aggregate policy-induced true/false/duplicate arrivals into finite M/M/c queues; reject unstable utilization or response-time violations before simulating material conditions, time-decayed protection, missed loss, false-alert interruption and unique common incidents.
  3. 3 Enforce sensitivity, false-positive, control, severity, availability, relation, budget and resource constraints; compare current state and return an expected-loss/protected-value Pareto frontier using exact or disclosed deterministic beam search.

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.
  • Arrival/service processes are adequate for M/M/c planning at the declared horizon, options have prospective local sensitivity/false-positive evidence, queue ownership is complete, and common incident value is unique.
  • The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.
  • This ranks supplied aggregate policies and never sends, suppresses or escalates alerts; named-person uses require separate lawful, human-governed processes and must not be inferred from this optimizer.

Minimum evidence

  • alert_risk_classes: required and organization-defined
  • response_queues: required and organization-defined
  • shared_incident_groups: required and organization-defined
  • alert_policy_options: required and organization-defined
  • scenarios: required and organization-defined
  • resource_capacities: at least 0 rows/items
  • implementation_budget: 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

  • one versioned multiple-choice alert-policy matrix per class joined to complete queue ownership and a coherent scenario set, with independently validated option behavior and unique common-loss groups
  • risk-class/queue/group boundaries, condition horizon and priors, sensitivity/false-positive/response limits, queue model/staffing/service/capacity/value half-life, option effects, interruption/full cost, value/loss, controls/severity, relations, resources, budget, scenarios and CVaR appetite

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": "choose one governed alert policy per" }
  → finds "optimize_attention_aware_alerting_portfolio"

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

gitrevio_capability_run
  { "capability_id": "optimize_attention_aware_alerting_portfolio", "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 operational alert decision integrity

Audit every point-in-time operational alert evaluation by recomputing fire/suppress decisions and verifying effective policy, cooldown, evidence freshness, context, controls, severity routing, acknowledgement, action and mature outcome lineage.

Constrained optimization

Forecast alert fatigue and missed risk loss

Forecast alert storms, duplicate notifications, aggregate attention-state saturation, missed material conditions, interruption cost and financial VaR/CVaR with a Markov-modulated Gamma-Poisson and compound log-normal model.

Markov & state-space control

Audit CI pipeline evidence integrity

Audit the complete point-in-time change-to-pipeline-to-job-to-rerun cohort, exposing missing CI, orphan records, future leakage, inconsistent required-job outcomes, incomplete provider evidence and same-configuration fail-then-pass flake proxies without scoring people.

Statistical audit & measurement

Audit incident learning evidence integrity

Audit the complete point-in-time incident-to-postmortem-to-corrective-action lineage, separating missing or contradictory evidence from genuine overdue learning debt without attributing individual fault.

Statistical audit & measurement

Audit root cause traceback evidence integrity

Audit whether an anomaly traceback is complete, point-in-time, multiplicity-controlled and honestly labeled as temporal or causal, including every upstream candidate, path lag, edge identification basis and later root-recovery validation.

Causal inference & experiment design

Estimate software reliability growth

Estimate long-run software reliability growth with a power-law nonhomogeneous Poisson process, bootstrap trend evidence, and future incident exposure.

Forecasting & survival

See every tool in Quality, incidents & reliability →

Ready to See Your Engineering work clearly?

Request a free demo